Multi-threaded speaker identification

ABSTRACT

A system, method, and computer-program product includes distributing a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads, executing the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files, generating, via a clustering algorithm, a plurality of clusters of embedding signatures based on a plurality of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files, and detecting a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 63/451,892, filed Mar. 13, 2023, and is a continuation-in-part of U.S. patent application Ser. No. 17/994,554, filed Nov. 28, 2022, which is a continuation of, and claims the benefit of priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 17/993,385 filed Nov. 23, 2022, and entitled “Multithreaded Speech Data Preprocessing”; which is a continuation-in-part of, and claims the benefit of priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 17/851,264 filed Jun. 28, 2022, and entitled “Speech Segmentation Based on Combination of Pause Detection and Speaker Diarization” (since issued as U.S. Pat. No. 11,538,481); which is a continuation-in-part of, and claims the benefit of priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 17/498,811 filed Oct. 12, 2021, and entitled “Dual Use of Acoustic Model in Speech-to-Text Framework” (since issued as U.S. Pat. No. 11,373,655); each of which is incorporated herein by reference in its entirety for all purposes.

Both U.S. patent application Ser. No. 17/993,385 and U.S. patent application Ser. No. 17/851,264 also claim the benefit of priority under 35 U.S.C. § 119(e) to both U.S. Provisional Application Ser. No. 63/297,002 filed Jan. 6, 2022 and U.S. Provisional Application Ser. No. 63/288,385 filed Dec. 10, 2021, both entitled “Joint Approach for Speech Segmentation and Speaker Diarization for Live-Stream Audio Input and An Improved Thread-Pool-Based Pipeline for Long Audio Transcription”; each of which is incorporated herein by reference in its entirety for all purposes.

U.S. patent application Ser. No. 17/498,811 is a continuation-in-part of, and claims the benefit of priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 17/205,871 filed Mar. 18, 2021, and entitled “Dynamic Model Selection In Speech-to-Text Processing” (since issued as U.S. Pat. No. 11,145,309); which is a continuation-in-part of, and claims the benefit of priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 17/138,521 filed Dec. 30, 2020, and entitled “Speech Audio Pre-Processing Segmentation” (since issued as U.S. Pat. No. 11,049,502); which is a continuation of, and claims the benefit of priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 17/138,445 filed Dec. 30, 2020, and entitled “Speech Audio Pre-Processing Segmentation” (since issued as U.S. Pat. No. 11,138,979); which claims the benefit of priority under 35 U.S.C. § 119(e) to U.S. Provisional Application Ser. No. 62/991,275 filed Mar. 18, 2020, and entitled “A Pipeline for Information Extraction from Audio Files”; each of which is incorporated herein by reference in its entirety for all purposes.

U.S. patent application Ser. No. 17/498,811 is also a continuation-in-part of, and claims the benefit of priority under 35 U.S.C. § 120 to, U.S. patent application Ser. No. 17/370,441 filed Jul. 8, 2021, and entitled “Speech-to-Analytics Framework with Support for Large N-Gram Corpora” (since issued as U.S. Pat. No. 11,404,053); which is a continuation of, and claims the benefit of priority under 35 U.S.C. § 120 to, International Application No. PCT/CN2021/082572 filed Mar. 24, 2021, and entitled “Speech-to-Analytics Framework with Support for Large N-Gram Corpora”; each of which is incorporated herein by reference in its entirety for all purposes.

To be more precise, International Application No. PCT/CN2021/082572 designates the United States such that it is eligible to be treated as if it were “a national application for patent regularly filed in the Patent and Trademark Office” with its Mar. 24, 2021 international filing date being treated as the filing date on which such regular filing is deemed to have occurred, as per at least 35 U.S.C. § 363. Therefore, and as per at least 35 U.S.C. § 120 and § 365(c), U.S. patent application Ser. No. 17/370,441 claims domestic priority to International Application No. PCT/CN2021/082572 as a “bypass” application (more specifically, a “bypass” continuation application).

BACKGROUND

It has become commonplace to perform automated speech-to-text conversion of captured speech audio. Such a conversion to text may be performed as part of receiving verbal commands used as input for the provision of various voice-controlled online services. Such a conversion to text may be performed as part of indexing and/or memorializing the contents of recorded voice messages or of phone conversations for future retrieval and reference. Such indexing and/or memorializing may be done as part of archiving official records, preserving testimony in judicial proceedings, preserving data gathered in scientific and/or medical field studies, etc.

Alternatively or additionally, such a conversion to text may be used as part of various automated analyses of the contents of conversations or verbal presentations to retrieve various insights. Such analyses may include an evaluation of the quality of service provided in telephone service calls, the efficiency or effectiveness of communication in emergency services calls, the effectiveness of an effort to disseminate information to the public in press interviews or in other verbal presentations, the audience participation and/or reaction to a verbal presentation, the identification of topic(s) of conversations and/or verbal presentations, the relative degrees of focus of each topic among multiple topics, the relative levels of participation among multiple speakers, the type and/or strength of sentiments concerning topics, etc. Such automated retrieval of insights may be performed to enhance the indexing and/or memorializing the contents of captured speech audio.

Regardless of the purpose for performing automated speech-to-text conversion and/or automated analyses, a longstanding challenge has been improving the accuracy of the speech-to-text conversion and/or of the analyses. As will be familiar to those skilled in the art, there are numerous challenges, including and not limited to, quality issues with the devices used to capture speech audio, high environmental noise levels, languages having multiple dialects, differences in regional accents, differences in idiomatic expressions, and/or per-person differences in pronunciation, speed of speaking, speaking volume, speech impediments, etc. Such accuracy issues with speech-to-text conversion result in the provision of error-laden text as the input to text analyses, which in turn, results in the generation of false and misleading insights.

Over time, various significant improvements have been made to acoustic models and language models that are used. However, there remains challenges in this technical field. By way of example, the preprocessing used to divide streamed speech audio and/or lengthy recorded speech audio into segments has seen comparatively little improvement.

SUMMARY

This summary is not intended to identify only key or essential features of the described subject matter, nor is it intended to be used in isolation to determine the scope of the described subject matter. The subject matter should be understood by reference to appropriate portions of the entire specification of this patent, any or all drawings, and each claim.

An apparatus includes at least one processor and a storage to store instructions that, when executed by the at least one processor, cause the at least one processor to perform operations including receive, from a requesting device via a network, a request to perform speech-to-text conversion of a specified speech data set representing speech audio. The at least one processor is also caused to, in response to the request, perform preprocessing operations including: within a first thread of a thread pool that includes multiple threads of execution supported by the at least one processor, perform a first pause detection technique to identify a first set of likely sentence pauses in the speech audio; within a second thread of the thread pool, perform a second pause detection technique to identify a second set of likely sentence pauses in the speech audio; and perform a speaker diarization technique to identify a set of likely speaker changes in the speech audio. The at least one processor is further caused to, in response to the request, perform speech-to-text processing operations including: divide the speech data set into multiple data segments that each represent a speech segment of multiple speech segments of the speech audio based on a combination of at least the first set of likely sentence pauses, the second set of likely sentence pauses, and the set of likely speaker changes; use at least an acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio; and generate a transcript of the speech data set based, at least in part, on the identified likely speech sounds, or transmit an indication of the generation of the transcript to the requesting device.

A computer-program product tangibly embodied in a non-transitory machine-readable storage medium includes instructions operable to cause at least one processor to perform operations including receive, from a requesting device via a network, a request to perform speech-to-text conversion of a specified speech data set representing speech audio. The at least one processor is also caused to, in response to the request, perform preprocessing operations including: within a first thread of a thread pool that includes multiple threads of execution supported by the at least one processor, perform a first pause detection technique to identify a first set of likely sentence pauses in the speech audio; within a second thread of the thread pool, perform a second pause detection technique to identify a second set of likely sentence pauses in the speech audio; and perform a speaker diarization technique to identify a set of likely speaker changes in the speech audio. The at least one processor is further caused to, in response to the request, perform speech-to-text processing operations including: divide the speech data set into multiple data segments that each represent a speech segment of multiple speech segments of the speech audio based on a combination of at least the first set of likely sentence pauses, the second set of likely sentence pauses, and the set of likely speaker changes; use at least an acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio; and generate a transcript of the speech data set based, at least in part, on the identified likely speech sounds, or transmit an indication of the generation of the transcript to the requesting device.

The first pause detection technique and the second pause detection technique may differ at least in susceptibility to inaccuracies in identifying sentence pauses caused by audio noise. The at least one processor may be caused to perform preprocessing operations including: based on the difference in susceptibility, and based on a level of audio noise present within the speech audio, derive a relative weighting among at least the first set of likely sentence pauses and the second set of likely sentence pauses; and based on the relative weighting, select likely sentence pauses for inclusion in a converged set of likely sentence pauses from among at least the first set of likely sentence pauses and the second set of likely sentence pauses. Dividing the speech data set into the multiple data segments based on the combination of at least the first set of likely sentence pauses, the second set of likely sentence pauses, and the set of likely speaker changes may include dividing the speech data set into the multiple data segments based on a combination of the converged set of likely sentence pauses and the set of likely speaker changes.

The first pause detection technique may include use, within the first thread, of comparisons of peak amplitudes of portions of the speech audio to a threshold amplitude to identify likely sentence pauses of the first set of likely sentence pauses; and the second pause detection technique may include use, within the second thread, of counts of quantities of consecutive blank symbols output by a neural network implementing an acoustic model to identify likely sentence pauses of the second set of likely sentence pauses.

Performing the speaker diarization technique may include the at least one processor being caused to perform further preprocessing operations including: divide the speech data set into a set of data fragments that each represent a fragment of a set of fragments of the speech audio; based on the converged set of likely sentence pauses, identify each fragment of the set of fragments of the speech audio that includes a portion of a likely sentence pause; and limit data fragments of the set of data fragments that are used to perform speaker diarization to data fragments that are not identified as including a portion of a likely sentence pause.

Performing the speaker diarization technique may include the at least one processor being caused to perform, within a third thread, and in parallel with performing the first pause detection technique and the second pause detection technique, further preprocessing operations including: divide the speech data set into a set of data fragments that each represent a fragment of a set of fragments of the speech audio; provide, to a speaker diarization neural network trained to output indications of vocal characteristics, each data fragment of the set of data fragments as an input to generate a corresponding speaker vector of a set of speaker vectors as an output, wherein each speaker vector comprises indications of vocal characteristics detected within the corresponding data fragment; cluster the speaker vectors of the set of speaker vectors to identify the speakers of the set of speakers; and identify each instance of a change in speaker between temporally consecutive fragments of the speech audio as a speaker change of the set of likely speaker changes.

Performing the speaker diarization technique may further include the at least one processor being caused to perform, within the third thread, further preprocessing operations comprising instantiate the speaker diarization neural network.

The first pause detection technique may include use, within the first thread, of comparisons of peak amplitudes of portions of the speech audio to a threshold amplitude to identify likely sentence pauses of the first set of likely sentence pauses. Performing the first pause detection technique may include the at least one processor being caused to perform, within the first thread, further preprocessing operations including: derive the threshold amplitude based on at least one peak amplitude of the speech audio; and derive an audio noise level based on at least one measure of a level of audio noise present within the speech audio. Using at least the acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio may include the at least one processor being caused to perform further speech-to-text processing operations including: analyze probability distributions that are output by the acoustic model, and that identify likely speech sounds, to identify combinations of speech sounds that correspond to candidate words; for each candidate word, use a language model to derive a corresponding candidate set of n-grams accompanied by corresponding indications of relative probabilities of use of each n-gram within the candidate set of n-grams; use at least the audio noise level to derive a weighting of relative susceptibility of the accuracy of the acoustic model and of the accuracy of the language model to the audio noise of the speech audio; and use the weighting along with at least one of probability distributions output by the acoustic model or the indications of relative probabilities output by the language model to identify each word that is to be included in the transcript.

The acoustic model may include a neural network trained to identify likely speech sounds in the speech audio; the acoustic model may output symbols that indicate at least one of graphemes or phonemes describing speech sounds; the acoustic model may include a connectionist temporal classification (CTC) output trained to output blank symbols indicative of consecutive instances of a text character; the second pause detection technique may include use, within the second thread, of counts of quantities of consecutive blank symbols output by the neural network to identify likely sentence pauses of the second set of likely sentence pauses; and performing the second sentence pause detection technique may include the at least one processor being caused to perform, within the second thread, and in parallel with performing the first pause detection technique, further preprocessing operations comprising instantiate an instance of the neural network.

Using at least the acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio may include the at least one processor being caused to perform speech-to-text processing operations including: instantiate another instance of the neural network; and provide indications of detected acoustic features of the speech segment of each data segment to the other instance of the acoustic model neural network as an input, and monitor outputs of the other instance of the acoustic model neural network for corresponding probability distributions indicative of relative probabilities of speech sounds, including probabilities of consecutive instances of a text character indicated by the CTC output.

Using at least the acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio may include the at least one processor being caused to perform operations including: analyze probability distributions that are output by the acoustic model, and that identify likely speech sounds, to identify combinations of speech sounds that correspond to candidate words; for each candidate word, perform, within a separate thread of the thread pool, an instance of a beam search of a language corpus of the language model to derive a corresponding candidate set of n-grams accompanied by corresponding indications of relative probabilities of use of each n-gram within the candidate set of n-grams; and use at least one of probability distributions output by the acoustic model or indications of relative probabilities output by the language model to identify each word that is to be included in the transcript.

A computer-implemented method includes receiving, by at least one processor, and from a requesting device via a network, a request to perform speech-to-text conversion of a specified speech data set representing speech audio. The method also includes, in response to the request, performing preprocessing operations including: within a first thread of a thread pool that comprises multiple threads of execution supported by the at least one processor, performing, by the at least one processor, a first pause detection technique to identify a first set of likely sentence pauses in the speech audio; within a second thread of the thread pool, performing, by the at least one processor, a second pause detection technique to identify a second set of likely sentence pauses in the speech audio; and performing, by the at least one processor, a speaker diarization technique to identify a set of likely speaker changes in the speech audio. The method further includes, in response to the request, performing speech-to-text processing operations including: dividing the speech data set into multiple data segments that each represent a speech segment of multiple speech segments of the speech audio based on a combination of at least the first set of likely sentence pauses, the second set of likely sentence pauses, and the set of likely speaker changes; using, by the at least one processor, at least an acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio; and generating, by the at least one processor, a transcript of the speech data set based, at least in part, on the identified likely speech sounds, or transmitting, from the at least one processor, an indication of the generation of the transcript to the requesting device.

The first pause detection technique and the second pause detection technique may differ at least in susceptibility to inaccuracies in identifying sentence pauses caused by audio noise. Performing preprocessing operations may further include: based on the difference in susceptibility, and based on a level of audio noise present within the speech audio, deriving, by the at least one processor, a relative weighting among at least the first set of likely sentence pauses and the second set of likely sentence pauses; and based on the relative weighting, selecting, by the at least one processor, likely sentence pauses for inclusion in a converged set of likely sentence pauses from among at least the first set of likely sentence pauses and the second set of likely sentence pauses. Dividing the speech data set into the multiple data segments based on the combination of at least the first set of likely sentence pauses, the second set of likely sentence pauses, and the set of likely speaker changes may include dividing, by the at least one processor, the speech data set into the multiple data segments based on a combination of the converged set of likely sentence pauses and the set of likely speaker changes.

The first pause detection technique may include using, by the at least one processor, and within the first thread, comparisons of peak amplitudes of portions of the speech audio to a threshold amplitude to identify likely sentence pauses of the first set of likely sentence pauses; and the second pause detection technique may include using, by the at least one processor, and within the second thread, counts of quantities of consecutive blank symbols output by a neural network implementing an acoustic model to identify likely sentence pauses of the second set of likely sentence pauses.

Performing the speaker diarization technique may include performing further preprocessing operations including: dividing the speech data set into a set of data fragments that each represent a fragment of a set of fragments of the speech audio; based on the converged set of likely sentence pauses, identifying, by the at least one processor, each fragment of the set of fragments of the speech audio that includes a portion of a likely sentence pause; and limiting, by the at least one processor, data fragments of the set of data fragments that are used to perform speaker diarization to data fragments that are not identified as including a portion of a likely sentence pause.

Performing the speaker diarization technique may include performing, within a third thread, and in parallel with performing the first pause detection technique and the second pause detection technique, further preprocessing operations including: dividing the speech data set into a set of data fragments that each represent a fragment of a set of fragments of the speech audio; providing, to a speaker diarization neural network trained to output indications of vocal characteristics, each data fragment of the set of data fragments as an input to generate a corresponding speaker vector of a set of speaker vectors as an output, wherein each speaker vector comprises indications of vocal characteristics detected within the corresponding data fragment; clustering, by the at least one processor, the speaker vectors of the set of speaker vectors to identify the speakers of the set of speakers; and identifying, by the at least one processor, each instance of a change in speaker between temporally consecutive fragments of the speech audio as a speaker change of the set of likely speaker changes.

Performing the speaker diarization technique may further include performing, within the third thread, further preprocessing operations including instantiating, by the at least one processor, the speaker diarization neural network.

The first pause detection technique may include using, by the at least one processor, and within the first thread, comparisons of peak amplitudes of portions of the speech audio to a threshold amplitude to identify likely sentence pauses of the first set of likely sentence pauses. Performing the first pause detection technique may include performing, within the first thread, further preprocessing operations including: deriving, by the at least one processor, the threshold amplitude based on at least one peak amplitude of the speech audio; and deriving, by the at least one processor, an audio noise level based on at least one measure of a level of audio noise present within the speech audio. Using at least the acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio may include performing further speech-to-text processing operations including:

analyzing, by the at least one processor, probability distributions that are output by the acoustic model, and that identify likely speech sounds, to identify combinations of speech sounds that correspond to candidate words; for each candidate word, using, by the at least one processor, a language model to derive a corresponding candidate set of n-grams accompanied by corresponding indications of relative probabilities of use of each n-gram within the candidate set of n-grams; using, by the at least one processor, at least the audio noise level to derive a weighting of relative susceptibility of the accuracy of the acoustic model and of the accuracy of the language model to the audio noise of the speech audio; and using, by the at least one processor, the weighting along with at least one of probability distributions output by the acoustic model or the indications of relative probabilities output by the language model to identify each word that is to be included in the transcript.

The acoustic model may include a neural network trained to identify likely speech sounds in the speech audio; the acoustic model may output symbols that indicate at least one of graphemes or phonemes describing speech sounds; the acoustic model may include a connectionist temporal classification (CTC) output trained to output blank symbols indicative of consecutive instances of a text character; the second pause detection technique may include using, by the at least one processor, and within the second thread, counts of quantities of consecutive blank symbols output by the neural network to identify likely sentence pauses of the second set of likely sentence pauses; and performing the second sentence pause detection technique may include performing, by the at least one processor, within the second thread, and in parallel with performing the first pause detection technique, further preprocessing operations comprising instantiating an instance of the neural network.

Using at least the acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio may including performing speech-to-text processing operations including: instantiating, by the at least one processor, another instance of the neural network; and providing indications of detected acoustic features of the speech segment of each data segment to the other instance of the acoustic model neural network as an input, and monitoring outputs of the other instance of the acoustic model neural network for corresponding probability distributions indicative of relative probabilities of speech sounds, including probabilities of consecutive instances of a text character indicated by the CTC output.

Using at least the acoustic model with each data segment of the multiple data segments to identify likely speech sounds in the speech audio may include performing operations including: analyzing, by the at least one processor, probability distributions that are output by the acoustic model, and that identify likely speech sounds, to identify combinations of speech sounds that correspond to candidate words; for each candidate word, performing, by the at least one processor, and within a separate thread of the thread pool, an instance of a beam search of a language corpus of the language model to derive a corresponding candidate set of n-grams accompanied by corresponding indications of relative probabilities of use of each n-gram within the candidate set of n-grams; and using, by the at least one processor, at least one of probability distributions output by the acoustic model or indications of relative probabilities output by the language model to identify each word that is to be included in the transcript.

An apparatus includes at least one processor and a storage to store instructions that, when executed by the at least one processor, cause the at least one processor to perform operations including receive, from a requesting device via a network, a request to perform speech-to-text conversion of a first speech data set representing a first speech audio. The at least one processor is also caused to, in response to the request, the at least one processor is caused to perform, within a first node device, preprocessing operations including: perform at least one pause detection technique to identify at least a first set of likely sentence pauses; or perform at least one speaker diarization technique to identify at least a first set of likely speaker changes. The at least one processor is further caused to, in response to the request, the at least one processor is caused to perform, within the first node device, speech-to-text processing operations including: based on at least one of the first set of likely sentence pauses or the first set of likely speaker changes, divide the first speech data set into multiple data segments that each represent a speech segment of multiple speech segments of the first speech audio; use a first instance of an acoustic model with each data segment of the multiple data segments to derive sets of probabilities of speech sounds uttered within the corresponding speech segment; store the sets of probabilities in temporal order within a first buffer queue instantiated within the first node device; distribute the sets of probabilities, from the first buffer queue and in temporal order, among multiple threads of a first thread pool, wherein each thread of the first thread pool comprises a thread of execution supported by the at least one processor; and within each thread of the first thread pool, the at least one processor is caused to perform operations including derive at least a first candidate word from one or more sets of probabilities that are distributed to the thread from the first buffer queue, based on at least the one or more sets of probabilities distributed to the thread, select either the first candidate word or a second candidate word as a next word most likely spoken in the first speech audio, wherein the second candidate word is derived within the thread by the at least one processor using a language model, and add the next word most likely spoken to a first transcript of the first speech audio.

A computer-program product tangibly embodied in a non-transitory machine-readable storage medium includes instructions operable to cause at least one processor to perform operations including receive, from a requesting device via a network, a request to perform speech-to-text conversion of a first speech data set representing a first speech audio. The at least one processor is also caused to, in response to the request, the at least one processor is caused to perform, within a first node device, preprocessing operations including: perform at least one pause detection technique to identify at least a first set of likely sentence pauses; or perform at least one speaker diarization technique to identify at least a first set of likely speaker changes. The at least one processor is further caused to, in response to the request, the at least one processor is caused to perform, within the first node device, speech-to-text processing operations including: based on at least one of the first set of likely sentence pauses or the first set of likely speaker changes, divide the first speech data set into multiple data segments that each represent a speech segment of multiple speech segments of the first speech audio; use a first instance of an acoustic model with each data segment of the multiple data segments to derive sets of probabilities of speech sounds uttered within the corresponding speech segment; store the sets of probabilities in temporal order within a first buffer queue instantiated within the first node device; distribute the sets of probabilities, from the first buffer queue and in temporal order, among multiple threads of a first thread pool, wherein each thread of the first thread pool comprises a thread of execution supported by the at least one processor; and within each thread of the first thread pool, the at least one processor is caused to perform operations including derive at least a first candidate word from one or more sets of probabilities that are distributed to the thread from the first buffer queue, based on at least the one or more sets of probabilities distributed to the thread, select either the first candidate word or a second candidate word as a next word most likely spoken in the first speech audio, wherein the second candidate word is derived within the thread by the at least one processor using a language model, and add the next word most likely spoken to a first transcript of the first speech audio.

Within the first node device: the first buffer queue may be implemented in a first-in-first-out (FIFO) configuration; the sets of probabilities stored within the first buffer queue may be distributed among the threads of the first thread pool as the derivation and selection of candidate words within each thread of the first thread pool, and for addition to the first transcript, are completed; the language model may be implemented as a language corpus stored within the first node device as a first corpus data set; the multiple threads of the first thread pool may share access to the first corpus data set; and within each thread of the first thread pool, the second candidate word may be derived from beam searches of the first corpus data set based on one or more temporally preceding words already selected for addition to the first transcript.

The apparatus may further include multiple node devices; the multiple node devices may include the first node device and a second node device; a second buffer queue may be instantiated within the second node device; a second corpus data set may be stored within the second node device; a second thread pool that may include multiple threads may be instantiated within the second node device; the multiple threads of the second thread pool may share access to the second corpus data set; sets of probabilities of speech sounds uttered within a corresponding speech segment of a second speech audio are stored in temporal order within the second buffer queue; and the sets of probabilities of speech sounds uttered within the second speech audio may be distributed, in temporal order, among the multiple threads of the second thread pool as derivation and selection of candidate words, based on the sets of probabilities of speech sounds uttered within the second speech audio, within each thread of the second thread pool are completed for words to add to a second transcript of the second speech audio.

The second buffer queue may be implemented in a FIFO configuration; and the sets of probabilities of speech sounds uttered within the second speech audio may be derived using a second instance of the acoustic model.

A second buffer queue may be instantiated within the first node device; a second thread pool comprising multiple threads may be instantiated within the first node device; the multiple threads of the second thread pool may share access to the first corpus data set with the multiple threads of the first thread pool; sets of probabilities of speech sounds uttered within a corresponding speech segment of a second speech audio may be stored in temporal order within the second buffer queue; and the sets of probabilities of speech sounds uttered within the second speech audio may be distributed, in temporal order, among the multiple threads of the second thread pool, based on the sets of probabilities of speech sounds uttered within the second speech audio, as derivation and selection of candidate words within each thread of the second thread pool are completed for words to add to a second transcript of the second speech audio.

Selecting, within each thread of the first thread pool, either the first candidate word or the second candidate word based on at least the one or more sets of probabilities distributed to the thread may include the at least one processor being caused to perform, within the thread, operations including: analyze the one or more sets of probabilities distributed to the thread to derive a degree of uncertainty; compare the degree of uncertainty to a threshold degree of uncertainty; in response to the degree of uncertainty being less than the threshold degree of uncertainty, the at least one processor is caused to select either the first candidate word as the next word most likely spoken in the first speech audio; and in response to at least the degree of uncertainty being greater than the threshold degree of uncertainty, the at least one processor is caused to select the second candidate word as the next word most likely spoken in the speech audio.

Within each thread of the first thread pool, the at least one processor may be caused to condition expending processing resources to use the language model to derive the second candidate word on the degree of uncertainty.

The at least one processor may be caused to perform further preprocessing operations including measuring a noise level of at least a portion of the first speech audio; and selecting, within each thread of the first thread pool, either the first candidate word or the second candidate word based on at least the one or more sets of probabilities distributed to the thread comprises the at least one processor being caused to perform, within the thread, operations including compare the noise level to a threshold noise level, in response to the noise level being less than the threshold noise level, the at least one processor is caused to select the first candidate word as the next word most likely spoken in the first speech audio, and in response to at least the noise level being greater than the threshold noise level, the at least one processor is caused to select the second candidate word as the next word most likely spoken in the speech audio.

Within each thread of the first thread pool, the at least one processor may be caused to condition expending processing resources to use the language model to derive the second candidate word on the noise level.

The first buffer queue may include multiple data buffers; storing the sets of probabilities in temporal order within the first buffer queue may include storing, within each data buffer of the multiple data buffers, multiple sets of probabilities that are derived by the acoustic model from a single data segment of the first speech audio; and distributing the sets of probabilities, from the first buffer queue and in temporal order, among the multiple threads of the first thread pool may include distributing, to each thread of the first thread pool, the multiple sets of probabilities stored within a single data buffer of the first buffer queue.

A computer-implemented method includes receiving, by at least one processor, and from a requesting device via a network, a request to perform speech-to-text conversion of a first speech data set representing a first speech audio. The method also includes, in response to the request, performing, within a first node device, preprocessing operations including: performing, by the at least one processor, at least one pause detection technique to identify at least a first set of likely sentence pauses; or performing, by the at least one processor, at least one speaker diarization technique to identify at least a first set of likely speaker changes. The method further includes, in response to the request, performing, within the first node device, speech-to-text processing operations including: based on at least one of the first set of likely sentence pauses or the first set of likely speaker changes, dividing the first speech data set into multiple data segments that each represent a speech segment of multiple speech segments of the first speech audio; using, by the at least one processor, a first instance of an acoustic model with each data segment of the multiple data segments to derive sets of probabilities of speech sounds uttered within the corresponding speech segment; storing the sets of probabilities in temporal order within a first buffer queue instantiated within the first node device; distributing, by the at least one processor, the sets of probabilities, from the first buffer queue and in temporal order, among multiple threads of a first thread pool, wherein each thread of the first thread pool comprises a thread of execution supported by the at least one processor; and within each thread of the first thread pool, performing operations including deriving, by the at least one processor, at least a first candidate word from one or more sets of probabilities that are distributed to the thread from the first buffer queue, based on at least the one or more sets of probabilities distributed to the thread, selecting, by the at least one processor, either the first candidate word or a second candidate word as a next word most likely spoken in the first speech audio, wherein the second candidate word is derived within the thread by the at least one processor using a language model, and adding the next word most likely spoken to a first transcript of the first speech audio.

Within the first node device: the first buffer queue may be implemented in a first-in-first-out (FIFO) configuration; the sets of probabilities stored within the first buffer queue may be distributed among the threads of the first thread pool as the derivation and selection of candidate words within each thread of the first thread pool, and for addition to the first transcript, are completed; the language model may be implemented as a language corpus stored within the first node device as a first corpus data set; the multiple threads of the first thread pool may share access to the first corpus data set; and the method may include, within each thread of the first thread pool, deriving, by the at least one processor, the second candidate word from beam searches of the first corpus data set based on one or more temporally preceding words already selected for addition to the first transcript.

The first node device and a second node device may be two node devices of multiple node devices; a second buffer queue may be instantiated within the second node device; a second corpus data set may be stored within the second node device; a second thread pool including multiple threads may be instantiated within the second node device; the multiple threads of the second thread pool may share access to the second corpus data set; sets of probabilities of speech sounds uttered within a corresponding speech segment of a second speech audio may be stored in temporal order within the second buffer queue; and the sets of probabilities of speech sounds uttered within the second speech audio may be distributed, in temporal order, among the multiple threads of the second thread pool as derivation and selection of candidate words, based on the sets of probabilities of speech sounds uttered within the second speech audio, within each thread of the second thread pool are completed for words to add to a second transcript of the second speech audio.

The second buffer queue may be implemented in a FIFO configuration; and the method may include using, by the at least one processor, a second instance of the acoustic model to derive the sets of probabilities of speech sounds uttered within the second speech audio.

A second buffer queue may be instantiated within the first node device; a second thread pool including multiple threads may be instantiated within the first node device; the multiple threads of the second thread pool may share access to the first corpus data set with the multiple threads of the first thread pool; sets of probabilities of speech sounds uttered within a corresponding speech segment of a second speech audio may be stored in temporal order within the second buffer queue; and the sets of probabilities of speech sounds uttered within the second speech audio may be distributed, in temporal order, among the multiple threads of the second thread pool, based on the sets of probabilities of speech sounds uttered within the second speech audio, as derivation and selection of candidate words within each thread of the second thread pool are completed for words to add to a second transcript of the second speech audio.

Selecting, within each thread of the first thread pool, either the first candidate word or the second candidate word based on at least the one or more sets of probabilities distributed to the thread may include performing, within the thread, operations including: analyzing, by the at least one processor, the one or more sets of probabilities distributed to the thread to derive a degree of uncertainty; comparing, by the at least one processor, the degree of uncertainty to a threshold degree of uncertainty; in response to the degree of uncertainty being less than the threshold degree of uncertainty, selecting, by the at least one processor, either the first candidate word as the next word most likely spoken in the first speech audio; and in response to at least the degree of uncertainty being greater than the threshold degree of uncertainty, selecting, by the at least one processor, the second candidate word as the next word most likely spoken in the speech audio.

The method may include, within each thread of the first thread pool, conditioning expending processing resources to use the language model to derive the second candidate word on the degree of uncertainty.

The method may include performing further preprocessing operations comprising measuring a noise level of at least a portion of the first speech audio. Selecting, within each thread of the first thread pool, either the first candidate word or the second candidate word based on at least the one or more sets of probabilities distributed to the thread may include performing, within the thread, operations including: comparing, by the at least one processor, the noise level to a threshold noise level; in response to the noise level being less than the threshold noise level, selecting, by the at least one processor, the first candidate word as the next word most likely spoken in the first speech audio; and in response to at least the noise level being greater than the threshold noise level, selecting, by the at least one processor, the second candidate word as the next word most likely spoken in the speech audio.

The method may include, within each thread of the first thread pool, conditioning expending processing resources to use the language model to derive the second candidate word on the noise level.

The first buffer queue may include multiple data buffers; storing the sets of probabilities in temporal order within the first buffer queue may include storing, within each data buffer of the multiple data buffers, multiple sets of probabilities that are derived by the acoustic model from a single data segment of the first speech audio; and distributing the sets of probabilities, from the first buffer queue and in temporal order, among the multiple threads of the first thread pool may include distributing, by the at least one processor, to each thread of the first thread pool, the multiple sets of probabilities stored within a single data buffer of the first buffer queue.

In some embodiments, a computer-program product embodied in a non-transitory machine-readable storage medium storing computer instructions that, when executed by one or more processors, perform operations comprising distributing a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads; executing the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files, wherein each of the plurality of audio processing threads: partitions a target audio data file of the plurality of audio data files into a plurality of audio data segments, computes a plurality of embedding values based on the plurality of audio data segments, generates, via a clustering algorithm, a plurality of clusters of audio data segments based on the plurality of embedding values, and computes a plurality of embedding signatures for the plurality of tentative speakers participating in the target audio data file based on the plurality of clusters of audio data segments; generating, via the clustering algorithm, a plurality of clusters of embedding signatures based on the plurality of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files; and detecting a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures.

In some embodiments, the plurality of audio data files include a first audio data file and a second audio data file, one of the plurality of clusters of embedding signatures includes an embedding signature associated with a first tentative speaker of the first audio data file and an embedding signature associated with a second tentative speaker of the second audio data file, and detecting the plurality of global speakers associated with the speech data corpus includes detecting that the first tentative speaker of the first audio data file and the second tentative speaker of the second audio data file correspond to a same global speaker of the plurality of global speakers based on the one of the plurality of clusters of embedding signatures including both the embedding signature of the first tentative speaker and the embedding signature of the second tentative speaker.

In some embodiments, the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file and a second cluster of audio data segments corresponding to a second tentative speaker in the target audio data file, and computing an embedding signature for the first tentative speaker and an embedding signature for the second tentative speaker includes: computing a centroid of the first cluster of audio data segments and a centroid of the second cluster of audio data segments, using the centroid of the first cluster of audio data segments as the embedding signature for the first tentative speaker, and using the centroid of the second cluster of audio data segments as the embedding signature for the second tentative speaker.

In some embodiments, the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file, the first cluster of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include speech audio spoken by the first tentative speaker, and computing an embedding signature for the first tentative speaker includes: implementing a speaker signature embeddings model, providing the plurality of embedding values associated with the first cluster of audio data segments as input to the speaker signature embeddings model, and computing, via the speaker signature embeddings model, an output comprising the embedding signature of the first tentative speaker based on the providing.

In some embodiments, detecting the plurality of global speakers associated with the speech data corpus includes determining that each of the plurality of clusters of embedding signatures relates to a unique global speaker in the speech data corpus, and labeling each of the plurality of clusters of embedding signatures with a unique global speaker label based on the determining.

In some embodiments, each of the plurality of audio data files is distributed to a target computing node of the plurality of computing nodes and a target audio processing thread of the target computing node, and executing the plurality of audio processing threads includes: concurrently executing the target audio processing thread associated with each of the plurality of audio data files, wherein the concurrently executing causes the plurality of tentative speakers in each of the plurality of audio data files to be detected in parallel.

In some embodiments, the plurality of computing nodes are sub-nodes of a main computing node, and generating the plurality of clusters of embedding signatures includes: collecting the plurality of embedding signatures computed at each of the sub-nodes; providing, to the clustering algorithm implemented at the main computing node, the plurality of embedding signatures computed at each of the sub-nodes; and generating, via the clustering algorithm implemented at the main computing node, the plurality of clusters of embedding signatures.

In some embodiments, each of the plurality of clusters of audio data segments corresponds to a unique one of the plurality of tentative speakers participating in the target audio data file, and each of the plurality of clusters of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include an utterance spoken by the unique one of the plurality of tentative speakers.

In some embodiments, computing the plurality of embedding values based on the plurality of audio data segments includes deriving, via one or more feature extraction algorithms, a plurality of feature vectors corresponding to the plurality of audio data segments; providing, to an embedding model, an input comprising the plurality of feature vectors; and computing, via the embedding model, an embedding value corresponding to each of the plurality of audio data segments based on the input.

In some embodiments, the speech data corpus stores the plurality of audio data files in a tabular data structure, and the tabular data structure comprises a plurality of rows that each correspond to a unique one of the plurality of audio data files.

In some embodiments, the plurality of computing nodes includes a first computing node and a second computing node, a first audio data file of the plurality of audio data files is processed by a respective audio processing thread of the plurality of audio processing threads implemented at the first computing node, a second audio data file of the plurality of audio data files is processed by a respective audio processing thread of the plurality of audio processing threads implemented at the second computing node, the target audio data file for the respective audio processing thread implemented at the first computing node corresponds to the first audio data file, and the target audio data file for the respective audio processing thread implemented at the second computing node corresponds to the second audio data file.

In some embodiments, the plurality of computing nodes includes a first computing node, a first audio data file of the plurality of audio data files is processed by a first audio processing thread of the plurality of audio processing threads implemented at the first computing node, a second audio data file of the plurality of audio data files is processed by a second audio processing thread of the plurality of audio processing threads implemented at the first computing node, the target audio data file for the first audio processing thread corresponds to the first audio data file, and the target audio data file for second audio processing thread corresponds to the second audio data file.

In some embodiments, a computer-implemented method comprises: distributing a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads; executing the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files, wherein each of the plurality of audio processing threads: partitions a target audio data file of the plurality of audio data files into a plurality of audio data segments, computes a plurality of embedding values based on the plurality of audio data segments, generates, via a clustering algorithm, a plurality of clusters of audio data segments based on the plurality of embedding values, and computes a plurality of embedding signatures for the plurality of tentative speakers participating in the target audio data file based on the plurality of clusters of audio data segments; generating, via the clustering algorithm, a plurality of clusters of embedding signatures based on the plurality of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files; and detecting a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures.

In some embodiments, the plurality of audio data files include a first audio data file and a second audio data file, one of the plurality of clusters of embedding signatures includes an embedding signature associated with a first tentative speaker of the first audio data file and an embedding signature associated with a second tentative speaker of the second audio data file, and detecting the plurality of global speakers associated with the speech data corpus includes detecting that the first tentative speaker of the first audio data file and the second tentative speaker of the second audio data file correspond to a same global speaker of the plurality of global speakers based on the one of the plurality of clusters of embedding signatures including both the embedding signature of the first tentative speaker and the embedding signature of the second tentative speaker.

In some embodiments, the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file and a second cluster of audio data segments corresponding to a second tentative speaker in the target audio data file, and computing an embedding signature for the first tentative speaker and an embedding signature for the second tentative speaker includes: computing a centroid of the first cluster of audio data segments and a centroid of the second cluster of audio data segments, using the centroid of the first cluster of audio data segments as the embedding signature for the first tentative speaker, and using the centroid of the second cluster of audio data segments as the embedding signature for the second tentative speaker.

In some embodiments, the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file, the first cluster of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include speech audio spoken by the first tentative speaker, and computing an embedding signature for the first tentative speaker includes: implementing a speaker signature embeddings model, providing the plurality of embedding values associated with the first cluster of audio data segments as input to the speaker signature embeddings model, and computing, via the speaker signature embeddings model, an output comprising the embedding signature of the first tentative speaker based on the providing.

In some embodiments, detecting the plurality of global speakers associated with the speech data corpus includes determining that each of the plurality of clusters of embedding signatures relates to a unique global speaker in the speech data corpus, and

labeling each of the plurality of clusters of embedding signatures with a unique global speaker label based on the determining.

In some embodiments, each of the plurality of audio data files is distributed to a target computing node of the plurality of computing nodes and a target audio processing thread of the target computing node, and executing the plurality of audio processing threads includes: concurrently executing the target audio processing thread associated with each of the plurality of audio data files, wherein the concurrently executing causes the plurality of tentative speakers in each of the plurality of audio data files to be detected in parallel.

In some embodiments, the plurality of computing nodes are sub-nodes of a main computing node, and generating the plurality of clusters of embedding signatures includes: collecting the plurality of embedding signatures computed at each of the sub-nodes; providing, to the clustering algorithm implemented at the main computing node, the plurality of embedding signatures computed at each of the sub-nodes; and generating, via the clustering algorithm implemented at the main computing node, the plurality of clusters of embedding signatures.

In some embodiments, each of the plurality of clusters of audio data segments corresponds to a unique one of the plurality of tentative speakers participating in the target audio data file, and each of the plurality of clusters of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include an utterance spoken by the unique one of the plurality of tentative speakers.

In some embodiments, computing the plurality of embedding values based on the plurality of audio data segments includes deriving, via one or more feature extraction algorithms, a plurality of feature vectors corresponding to the plurality of audio data segments; providing, to an embedding model, an input comprising the plurality of feature vectors; and computing, via the embedding model, an embedding value corresponding to each of the plurality of audio data segments based on the input.

In some embodiments, a computer-implemented system comprises: one or more processors; a memory; a computer-readable medium operably coupled to the one or more processors, the computer-readable medium having computer-readable instructions stored thereon that, when executed by the one or more processors, cause a computing device to perform operations comprising: distributing a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads; executing the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files, wherein each of the plurality of audio processing threads: partitions a target audio data file of the plurality of audio data files into a plurality of audio data segments, computes a plurality of embedding values based on the plurality of audio data segments, generates, via a clustering algorithm, a plurality of clusters of audio data segments based on the plurality of embedding values, and computes a plurality of embedding signatures for the plurality of tentative speakers participating in the target audio data file based on the plurality of clusters of audio data segments; generating, via the clustering algorithm, a plurality of clusters of embedding signatures based on the plurality of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files; and detecting a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures.

In some embodiments, the plurality of audio data files include a first audio data file and a second audio data file, one of the plurality of clusters of embedding signatures includes an embedding signature associated with a first tentative speaker of the first audio data file and an embedding signature associated with a second tentative speaker of the second audio data file, and detecting the plurality of global speakers associated with the speech data corpus includes detecting that the first tentative speaker of the first audio data file and the second tentative speaker of the second audio data file correspond to a same global speaker of the plurality of global speakers based on the one of the plurality of clusters of embedding signatures including both the embedding signature of the first tentative speaker and the embedding signature of the second tentative speaker.

In some embodiments, the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file and a second cluster of audio data segments corresponding to a second tentative speaker in the target audio data file, and computing an embedding signature for the first tentative speaker and an embedding signature for the second tentative speaker includes: computing a centroid of the first cluster of audio data segments and a centroid of the second cluster of audio data segments, using the centroid of the first cluster of audio data segments as the embedding signature for the first tentative speaker, and using the centroid of the second cluster of audio data segments as the embedding signature for the second tentative speaker.

In some embodiments, the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file, the first cluster of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include speech audio spoken by the first tentative speaker, and computing an embedding signature for the first tentative speaker includes: implementing a speaker signature embeddings model, providing the plurality of embedding values associated with the first cluster of audio data segments as input to the speaker signature embeddings model, and computing, via the speaker signature embeddings model, an output comprising the embedding signature of the first tentative speaker based on the providing.

In some embodiments, detecting the plurality of global speakers associated with the speech data corpus includes determining that each of the plurality of clusters of embedding signatures relates to a unique global speaker in the speech data corpus, and labeling each of the plurality of clusters of embedding signatures with a unique global speaker label based on the determining.

In some embodiments, each of the plurality of audio data files is distributed to a target computing node of the plurality of computing nodes and a target audio processing thread of the target computing node, and executing the plurality of audio processing threads includes: concurrently executing the target audio processing thread associated with each of the plurality of audio data files, wherein the concurrently executing causes the plurality of tentative speakers in each of the plurality of audio data files to be detected in parallel.

In some embodiments, the plurality of computing nodes are sub-nodes of a main computing node, and generating the plurality of clusters of embedding signatures includes: collecting the plurality of embedding signatures computed at each of the sub-nodes; providing, to the clustering algorithm implemented at the main computing node, the plurality of embedding signatures computed at each of the sub-nodes; and generating, via the clustering algorithm implemented at the main computing node, the plurality of clusters of embedding signatures.

In some embodiments, each of the plurality of clusters of audio data segments corresponds to a unique one of the plurality of tentative speakers participating in the target audio data file, and each of the plurality of clusters of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include an utterance spoken by the unique one of the plurality of tentative speakers.

In some embodiments, computing the plurality of embedding values based on the plurality of audio data segments includes deriving, via one or more feature extraction algorithms, a plurality of feature vectors corresponding to the plurality of audio data segments; providing, to an embedding model, an input comprising the plurality of feature vectors; and computing, via the embedding model, an embedding value corresponding to each of the plurality of audio data segments based on the input.

The foregoing, together with other features and embodiments, will become more apparent upon referring to the following specification, claims, and accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure is described in conjunction with the appended figures:

FIG. 1 illustrates a block diagram that provides an illustration of the hardware components of a computing system, according to some embodiments of the present technology.

FIG. 2 illustrates an example network including an example set of devices communicating with each other over an exchange system and via a network, according to some embodiments of the present technology.

FIG. 3 illustrates a representation of a conceptual model of a communications protocol system, according to some embodiments of the present technology.

FIG. 4 illustrates a communications grid computing system including a variety of control and worker nodes, according to some embodiments of the present technology.

FIG. 5 illustrates a flow chart showing an example process for adjusting a communications grid or a work project in a communications grid after a failure of a node, according to some embodiments of the present technology.

FIG. 6 illustrates a portion of a communications grid computing system including a control node and a worker node, according to some embodiments of the present technology.

FIG. 7 illustrates a flow chart showing an example process for executing a data analysis or processing project, according to some embodiments of the present technology.

FIG. 8 illustrates a block diagram including components of an Event Stream Processing Engine (ESPE), according to embodiments of the present technology.

FIG. 9 illustrates a flow chart showing an example process including operations performed by an event stream processing engine, according to some embodiments of the present technology.

FIG. 10 illustrates an ESP system interfacing between a publishing device and multiple event subscribing devices, according to embodiments of the present technology.

FIG. 11 illustrates a flow chart showing an example process of generating and using a machine-learning model according to some aspects.

FIG. 12 illustrates an example machine-learning model based on a neural network.

FIG. 13 illustrates an example of distributed execution of routines using multiple containers.

FIGS. 14A, 14B, 14C, 14D, 14E and 14F, together, illustrate differing example embodiments of a processing system.

FIGS. 15A, 15B, 15C, 15D, 15E and 15F, together, illustrate aspects of an example implementation of a framework based on the example embodiment of FIGS. 14A-C.

FIGS. 16A, 16B, 16C, 16D, 16E and 16F, together, illustrate aspects of an example implementation of a framework based on the example embodiment of FIGS. 14D-F.

FIGS. 17A, 17B and 17C, together, illustrate an example of employing an APA pause detection technique to derive a pause set of indications of likely sentence pauses within the speech audio of a speech data set.

FIGS. 18A and 18B, together, illustrate an example of employing a CTC pause detection technique to derive another pause set of indications of likely sentence pauses within the same speech audio of the same speech data set of FIGS. 17A-C.

FIGS. 19A, 19B, 19C and 19D, together, illustrate an example of employing a speaker diarization technique to derive a change set of indications of likely speaker changes within the speech audio of the same speech data set of FIGS. 17A-C

FIGS. 20A, 20B, 20C and 20D, together, illustrate differing examples of combining pause set(s) of indications of likely speech pauses generated in FIGS. 17A-C and in FIGS. 18A-B with at least one change set of indications of likely speaker changes generated in FIGS. 19A-D to generate a single converged set of indications of likely sentence pauses in either of the example embodiments of FIGS. 14A-C or FIGS. 14D-F.

FIGS. 21A, 21B, 21C, 21D, 21E, 21F, 21G, 2111 and 211 , taken together, illustrate an example of using the data segments generated in FIGS. 20A-C, an acoustic model, and n-gram language model to generate a transcript in the example embodiment of FIGS. 14A-B.

FIGS. 22A, 22B, 22C, 22D, 22E and 22F, taken together, illustrate an example of using the data segments generated in FIGS. 20A-B, an acoustic model, and n-gram language model to generate a transcript in the example embodiment of FIGS. 14D-F.

FIGS. 23A, 23B and 23C each illustrate examples of additional enhancements to the speech-to-text processing operations of either FIGS. 21A-I or FIGS. 22A-F.

FIGS. 24A, 24B, 24C, 24D, 24E, 24F and 24G, together, illustrate aspects of the generation and/or augmentation of a larger than commonplace n-gram corpus of the type that may be used as described in the processing operations of FIGS. 21A-I, 22A-F and 23A-C.

FIGS. 25A, 25B, 25C, 25D, 25E and 25F, together, illustrate an example logic flow of operations performed within a processing system to perform pre-processing and speech-to-text processing operations.

FIG. 26 illustrates an example logic flow of operations performed within a processing system to perform speech-to-text processing operations.

FIG. 27 illustrates an example flow chart for detecting a plurality of global speakers in a speech data corpus, according to some embodiments of the present technology.

FIG. 28 illustrates an example of distributing a plurality of audio data files to a plurality of computing nodes, according to some embodiments of the present technology.

FIGS. 29-31 illustrate example operations of an audio processing thread, according to some embodiments of the present technology.

FIG. 32 illustrates an example of a clustering algorithm generating a plurality of clusters of audio data segments, according to some embodiments of the present technology.

FIG. 33 illustrates an example of a plurality of audio processing threads computing a plurality of embedding signatures, according to some embodiments of the present technology.

FIG. 34 illustrates an example of a clustering algorithm generating a plurality of clusters of embedding signatures, according to some embodiments of the present technology.

DETAILED DESCRIPTION

Various embodiments are generally directed to techniques for improving the accuracy of speech-to-text conversion and efficacy of associated text analytics. More specifically, a framework for the derivation of insights into the content of pieces of speech audio may incorporate a chain of pre-processing, processing and post-processing operations that are selected to provide improved insights. During pre-processing, as an alternative to the commonplace approach of simply dividing speech audio into equal-length segments without regard to its content, a combination of pause detection techniques is used to identify likely sentence pauses. Additionally, speaker diarization may also be performed to identify likely changes between speakers. The speech audio is then divided into speech segments at likely sentence pauses and/or at likely speaker changes so that the resulting speech segments are more likely to contain the pronunciations of complete sentences by individual speakers. During speech-to-text processing, the derived probability distributions associated with the identification of more likely graphemes (e.g., text characters representing phonemes) and/or pauses by an acoustic model, as well as the probability distributions associated with the identification of more likely n-grams by a language model, are used in identifying the sentences spoken in the speech audio to generate a corresponding transcript. During text analytics post-processing, the corresponding transcript is analyzed to select words that are pertinent to identifying topics or sentiments about topics, and/or analyzed along with other transcripts to identify relationships between different pieces of speech audio.

Turning to the pre-processing operations, as will be familiar to those skilled in the art, many of the components employed in performing many of the processing operations of speech-to-text conversion (e.g., acoustic feature detection, acoustic models, language models, etc.) have capacity limits on how large a portion of speech audio is able to be accepted as input. Thus, speech audio must be divided into smaller portions that fit within such capacity limits.

As part of an improved approach to dividing speech audio into segments, a combination of multiple pause detection techniques is used to provide improved identification of pauses in the speech audio that are likely to be pauses between sentences to enable the division of the speech audio into segments at least at the midpoints within such likely sentence pauses. By dividing speech audio at least at midpoints within likely sentence pauses to form the segments, each segment is caused to include a higher proportion of complete pronunciations of whole phonemes, whole words, whole phrases and/or whole sentences, thereby enabling greater accuracy in the performance of subsequent processing operations. Also, with fewer phonemes and/or other speech parts being split across the divides between pairs of adjacent segments, there are fewer fragments of phonemes or other speech parts to potentially cause the errant identification of extra text characters and/or words that aren't actually present. Thus, such improvements in the identification of likely sentence pauses during pre-processing serves to enable corresponding improvements in subsequent processing operations to identify text characters, whole words, phrases and/or sentences.

As will be familiar to those skilled in the art, there are many linguistic characteristics that vary greatly among the wide variety of languages that are spoken around the world. By way of example, the manner in which combinations of tone, volume, generation of vowels versus consonants, etc., are used to form words may differ greatly between languages. However, the manner in which the relative lengths of pauses are used to separate sounds within words, to separate words within sentences, and to separate sentences tend to be quite similar. More specifically, the relatively short lengths of pauses between sounds within words tend to arise more out of the time needed to reposition portions of the vocal tract when transitioning from producing one sound to producing another sound amidst pronouncing a word. In contrast, the somewhat longer lengths of pauses between words tend to be dictated more by linguistic rules that provide a mechanism to enable a listener to hear the pronunciations of individual words more easily. Similarly, the still longer lengths of pauses between sentences also tend to be dictated by linguistic rules that provide a mechanism to make clear where the speaking of one sentence ends, and the speaking of the next sentence begins. Thus, the ability to identify pauses and/or to distinguish among pauses within words, pauses between words and/or pauses between sentences may be used by each of the multiple pause detection techniques to identify likely sentence pauses at which speech audio may be divided into segments in a manner that may be independent of the language that is spoken.

In preparation for the performance of the multiple pause detection techniques, the speech audio may be initially divided into equal-length chunks. The full set of chunks of the speech audio may then be provided as an input to each of multiple pause detection techniques, which may be performed, at least partially in parallel, to each independently generate its corresponding data structure specifying its corresponding set of likely sentence pauses present within the speech audio.

In some embodiments, the multiple pause detection techniques may include an adaptive peak amplitude (APA) pause detection technique in which a peak amplitude is separately determined for each chunk of the speech audio, with a threshold amplitude being derived therefrom that is used to distinguish pauses from speech sounds. More precisely, the peak amplitude that occurs within each chunk is measured, and then a preselected percentile amplitude across all of peak amplitudes of all of the chunks is derived to become a threshold amplitude. With the threshold amplitude so derived, all of the chunks with a peak amplitude above the threshold amplitude are deemed to be speech chunks, while all of the chunks with a peak amplitude below the threshold amplitude are deemed to be pause chunks. In this way, the threshold amplitude used in distinguishing pauses from speech sounds is caused to be adaptive to provide some degree of resiliency in addressing differences in speech audio amplitude and/or in audio noise levels that may thwart the typical use of a fixed threshold amplitude to distinguish between pauses and speech sounds.

Another adaptive mechanism may then be used to distinguish a pause occurring between sentences from other shorter pauses occurring between words or occurring within words, as well as to distinguish from still other shorter pauses that may occur as a result of various anomalies in capturing the speech audio. Starting at the beginning of the speech audio, a window that covers a preselected quantity of temporally adjacent chunks may be shifted across the length of the speech audio, starting with the earliest chunk and proceeding through temporally adjacent chunks toward the temporally latest chunk. More specifically, with the window positioned to begin with the earliest chunk, measurements of the lengths of each identified pause within the window may be taken to identify the longest pause thereamong (i.e., the pause made up of the longest set of consecutive pause chunks). The longest pause that is so identified within the window may then be deemed likely to be a sentence pause. The window may then be shifted away from the earliest chunk and along the speech audio so as to cause the window to now begin with the chunk just after the just-identified likely sentence pause. With the window so repositioned, again, measurements of the lengths of each identified pause within the window may be taken to again identify the longest pause thereamong. Again, the longest pause that is so identified within the window may be deemed likely to be a sentence pause. This may be repeated until the window has been shifted along the entirety of the length of the speech audio to the temporally latest chunk.

An indication of each of the pauses that has been deemed a likely sentence pause may be added to a set of indications of likely sentence pauses identified by the APA pause detection technique, which may be stored as a distinct data structure. The length of the window may be selected to ensure that there cannot be a distance between any adjacent pair of likely sentence pauses that is greater than a capacity limitation that may be present in subsequent processing. Alternatively, or additionally, it may be that instances of any adjacent pair of likely sentence pauses that are closer to each other than a predetermined threshold period of time are not permitted. Wherever such a pair of all-too-close adjacent likely sentence pauses might occur, one or the other may be removed from (or not be permitted to be added to) the set of indications of likely sentence pauses identified by the APA pause detection technique.

Alternatively, or additionally, in some embodiments, the multiple pause detection techniques may include the use of a connectionist temporal classification (CTC) pause detection technique in which instances of consecutive blank symbols (sometimes also referred to as “non-alphabetical symbols” or “artificial symbols”) generated by a CTC output of an acoustic model neural network trained to implement an acoustic model are used to identify likely sentence pauses. Such an acoustic model neural network incorporating a CTC output would normally be used to identify likely graphemes, such as text characters representing likely phoneme(s), in speech audio based on various acoustic features that are identified as present therein. In such normal use, the CTC output serves to augment the probabilistic indications of such text characters (graphemes) that are generated by the acoustic model neural network with blank symbols that serve to identify instances of consecutive occurrences of the same text character (e.g., the pair of “s” characters in the word “chess”), despite the absence of an acoustic feature that would specifically indicate such a situation (e.g., no acoustic feature in the pronunciation of the “s” sound in the word “chess” that indicates that there are two consecutive “s” characters therein). However, it has been observed through experimentation that the CTC output of such an acoustic model neural network may also be useful in identifying sentence pauses, as it has been observed that its CTC output tends to generate relatively long strings of consecutive blank symbols that tend to correspond to where sentence pauses occur.

In using such an acoustic model neural network for the detection of sentence pauses, each chunk is provided to the acoustic model neural network as an input, and the CTC output for that chunk is monitored for occurrences of strings of consecutive blank symbols, and the length of each such string is compared to a threshold blank string length. Each string of consecutive blank symbols that is at least as long as the threshold blank string length may be deemed to correspond to what is likely a sentence pause. In some embodiments, the threshold blank string length may be derived during training of the acoustic model neural network to implement an acoustic model, and/or during testing of the results of that training. Portions of speech audio that are known to include pauses between sentences may be provided as input to the acoustic model neural network and the lengths of the strings of consecutive blank symbols that are output may be monitored to determine what the threshold blank string length should be. Regardless of the exact manner in which the threshold blank string length is arrived at, an indication of each of the pauses that has been deemed a likely sentence pause may be added to the set of indications of likely sentence pauses identified by the CTC pause detection technique, which may be stored as a distinct data structure.

It should be noted that, in some embodiments, the same acoustic model neural network with CTC output that is employed in the CTC pause detection technique during pre-processing may also be employed during the subsequent processing to perform the function for which it was trained. Specifically, that same acoustic model neural network may be used to identify likely text characters from acoustic features detected in the speech audio, including using its CTC output to augment such probabilistic indications of text characters with blank symbols indicative of instances in which there are likely consecutive occurrences of the same text character.

In some embodiments, following the completion of the performances of all of the multiple pause detection techniques, the resulting multiple sets of indications of likely sentence pauses may then be combined in any of a variety of ways to generate a single set of indications that describe the manner in which the speech audio is to be divided into segments based on likely sentence pauses. However, in other embodiments, it may be that the multiple sets of indication of likely sentence pauses may, instead, be used as an input to the performance of at least one speaker diarization technique to identify instances in the speech audio at which there is a change in speaker(s). As will be familiar to those skilled in the art, while there may be instances in a conversation among two or more speakers in which at least a subset of sentence pauses may also mark instances in which there is a change in who is speaking, it is also not uncommon for there to be instances in a conversation among two or more speakers in which there are overlapping speakers, such as instances where one speaker starts speaking while not waiting for another to finish speaking. As a result, there may be instances where there are changes in who is speaking that are not coincident with any form of pause. Therefore, it may be deemed desirable to use at least one speaker diarization technique to identify instances in the speech audio at which it is likely there was a change in speakers to further enhance the segmentation of the speech audio that is to be performed in preparation for the subsequent speech-to-text processing operations.

In some embodiments, a speaker diarization technique that may be used may include the use of a speaker diarization neural network that has been trained to generate speaker vectors that are each indicative of various vocal characteristics of a speaker (or of a combination of speakers). More precisely, such a speaker diarization neural network may be trained to derive binary values that each indicate the presence or absence of a particular vocal characteristic, and/or to derive numeric values that each indicate a measure (e.g., a level) associated with a particular vocal characteristic. These binary and/or numeric values of various vocal characteristics may be combined into a speaker vector (e.g., a one-dimensional array of those binary and/or numeric values).

In a manner somewhat similar to each of the aforedescribed pause detection techniques, it may be that the speech audio is, again, divided into equal-length chunks. Following this division into chunks, each chunk may be further divided into fragments. Following this division into fragments, the separate sets of indications of likely sentence pauses derived by each of the pause detection techniques may then be used to identify, within each chunk, any fragments that likely include a sentence pause such that there is at least a portion of the speech audio within such fragments that likely does not include speech sounds. Such “non-speech” fragments may then be removed from each chunk.

Following such removal of non-speech fragment(s) from each chunk, each remaining fragment of each chunk may then be provided as an input to the speaker diarization neural network so that a separate speaker vector is generated by the speaker diarization neural network for each fragment. For each chunk, the speaker vectors that are generated from the fragments within that chunk may be used together to identify all of the speakers who spoke within the portion of speech audio represented by that chunk, as well as each occurrence of a change that occurred during that portion of speech audio.

It is envisioned that each speaker vector will include binary and/or numerical values for each of numerous vocal characteristic such that each speaker vector may effectively represent a point in a multi-dimensional space. Indeed, a clustering technique may be used where the clustering of points corresponding to the speaker vectors may be used to identify individual speakers (or combinations of speakers). In such clustering, there may be a threshold distance between points that may be used, at least initially, to distinguish between points that belong together in a single cluster that is associated with a single speaker (or a single combination of speakers), and points that belong to different clusters. Alternatively, or additionally, there may be a threshold number of occurrences of outlier points that must be identified and that must be closely clustered enough for a new speaker to be deemed as having been identified.

Such clustering may be carried out in a chronological order in which the point associated with each speaker vector is plotted in an order that proceeds from the earliest fragment within a chunk to the latest fragment within that chunk. In this way, there may be one or more initial clusters that develop from the speaker vectors of the earliest fragments in a chunk. The one or more initial clusters may correspond to one or more speakers who were speaking at the start of the portion of speech audio represented by the chunk. As speaker vectors associated with increasingly later fragments are also plotted, a change in speakers may become evident where there ceases to be further points added to existing cluster(s), and/or as there begin to be points added that begin to form new cluster(s). For each instance in which a speaker begins speaking and/or in which a speaker ceases speaking, an indication of a likely speaker change may be added to a set of indications of likely speaker changes, which may be stored as a distinct data structure.

Following the completion of the performances of the multiple pause detection techniques and following the completion of the performance of the at least one speaker diarization technique, the resulting sets of indications of likely sentence pauses and likely speaker changes may then be combined in any of a variety of ways to generate a single set of segmentation indications that describe the manner in which the speech audio is to be divided into segments. In some embodiments, such a single set of segmentation indications may be implemented as a set of indications of each location in the speech audio at which a division between segments is to occur, thereby indicating where each segment of speech audio begins and/or ends.

The manner in which the multiple sets of indications of likely sentence pauses and of likely speaker changes are combined to derive such a single set of segmentation indications may include the use of relative weighting factors for at least the multiple sets of likely sentence pauses that may be dynamically adjusted based on levels of audio noise detected as being present within the speech audio. This may be done in recognition of each of the different pause detection techniques being more or less susceptible than others to audio noise. Thus, the multiple sets of indications of likely sentence pauses may be combined, first, to derive a single set of indications of likely sentence pauses within the speech audio. It should be noted that, where more than one speaker diarization technique was used, a similar approach of using relative weighting may be applied in combining multiple sets of indications of speaker changes to derive a single set of indications of speaker changes within the speech audio. Then, the single set of indications of likely sentence pauses and the single set of indications of likely speaker changes may be combined to derive the single set of segmentation indications.

Upon completion of the pre-processing operations, including segmentation based on a combination of likely sentence pauses and likely speaker changes, there may be no further use made of the chunks into which the speech audio was initially divided, and those chunks may be discarded from storage. Instead, the speech audio may be divided, again, to form speech segments, where each such division between two segments occurs at the midpoint of one of the likely sentence pauses and/or of one of the likely speaker changes. Thus, unlike the chunks of speech audio used in the pre-processing operations, each of the speech segments generated for the text-to-speech processing operations is more likely to contain the pronunciation of an entire sentence as spoken by a speaker, thereby decreasing the likelihood that the pronunciations of words may be split across segments, and increasing the likelihood that the entire context of each word will be present within a single segment. In this way, each speech segment is more likely to contain a more complete set of the acoustic information needed to identify graphemes, phonemes, text characters, words, phrases, sentences etc. in the speech-to-text processing operations, thereby enabling greater accuracy in doing so.

Turning to the speech-to-text processing operations, each of the speech segments may be provided as input to a feature detector, in which the speech audio within each speech segment is searched for any instances of a pre-selected set of particular acoustic features. It may be that multiple instances of the feature detector are executed, at least partially in parallel, across multiple threads of execution within a single device, and/or across multiple node devices. As part of such feature detection, each speech segment may be divided into multiple speech frames that are each of an equal temporal length, and each speech frame of a speech segment may be provided, one at a time, as input to a feature detector. As each instance of an acoustic feature is identified within a speech frame, an indication of the type of acoustic feature identified and when it occurs within the span of time covered by the speech frame may be stored within the feature vector that corresponds to the speech frame. The feature vectors for each speech segment may then be used by a combination of acoustic and language models to identify spoken words and generate a transcript.

More precisely, the feature vectors for each speech segment may be provided as input to an acoustic model. The acoustic model may be implemented using any of a variety of technologies, including and not limited to, a neural network, a hidden Markov model, or a finite state machine. It may be that multiple instances of the acoustic model are instantiated and used, at least partially in parallel, across multiple threads of execution within a single device, and/or across multiple node devices. Based on the acoustic features that are identified by each feature vector as present within its corresponding speech frame, the acoustic model may generate probability distributions of the grapheme(s) that were spoken within each speech frame, and/or of the pauses that occurred within each speech frame.

Such probability distributions may then be grouped in temporal order to form sets of probability distributions that correspond to the speech segments, and each such set may then be provided as input to a decoder that is implemented using an n-gram language model. Using such a set of probability distributions, and using the contextual information inherently provided by their temporal ordering, the decoder may identify the most likely combinations of words spoken to form sentences (or at least phrases) within the corresponding speech segment. In this way, the decoder may derive a transcript of what was spoken in the speech audio, and such a transcript may be stored in a manner that is associated with the speech audio for future reference.

As will be familiar to those skilled in the art, it has become commonplace (at least in speech recognition systems having sufficient processing and storage resources) to employ a two-stage combination of an acoustic model and a language model to identify the words spoken in speech audio based on the identified acoustic features. In such speech recognition systems, the acoustic model is typically relied upon to perform a first pass at identifying words that are likely to be the ones that were spoken, and the language model is typically relied upon to perform the next and final pass by refining the identification of such spoken words such that the words identified by the language model are the ones from which a transcript is generated. Such a two-stage use of a combination of acoustic and language models has proven to be significantly more accurate in performing speech recognition than the earlier commonplace practice of applying an acoustic model, alone.

However, while the reduction in errors in speech recognition that has been achieved through using such a two-pass combination of acoustic and language models is significant, even this reduced error rate is still frequently undesirably high enough as to have merited further efforts over a number of years to further reduce it. A possible source of this still elevated error rate, at least in some situations, has been such reliance on using a language model to always perform the final pass to provide the final identification of each word spoken in speech audio. It should be remembered that a good language model is usually one that closely models a language as that language is used correctly. Thus, part of the still elevated error rate may arise from the fact that a person may make mistakes in vocabulary and/or syntax when speaking, while the language model may tend to fight against correctly identifying that person's words as actually spoken as it effectively attempts to enforce its model of what that person's words should have been.

As illustrated by at least this one example, there can be situations in which it may be desirable to rely more on an acoustic model, than on a language model, to correctly identify spoken words. It has long been recognized that an acoustic model can be highly accurate in identifying spoken words where the pronunciation of words is of sufficient clarity, and where the acoustic conditions associated with the reception of those spoken words are sufficiently favorable (e.g., sufficiently free of noise). As will be familiar to those skilled in the art, the longstanding practice of reliance on a language model to provide the final identification of words was largely influenced by a need to accommodate less ideal conditions in which the pronunciation of words may not be as clear and/or where the acoustic conditions may not be so favorable. In such situations, gaps may occur in the reception of spoken words, and on many of such occasions, a language model can compensate for such instances of missing acoustic information.

To further improve upon the error rate of such typical two-stage use of a combination of an acoustic model and a language model, some embodiments may dynamically vary the relative weighting assigned to each of the acoustic model and the language model per-word based on the degree of uncertainty in the per-grapheme probability distributions output by the acoustic model for each word. Stated differently, it may be that the probability distributions of graphemes that are output by the acoustic model for a single word are analyzed to derive a corresponding degree of perplexity for each probability distribution. Such a degree of perplexity may serve as an indication of the degree to which a probability distribution presents an indefinite indication of which utterance occurred during a corresponding portion of speech audio. Where the degree of perplexity of probability distributions for graphemes associated with a word are deemed to be lower than a pre-determined threshold, then greater weight may be dynamically assigned to the identification of that word based on those probability distributions such that the acoustic model is relied upon to identify that word. However, where the degree of perplexity of such probability distributions associated with a word are deemed to be higher than a pre-determined threshold, then greater weight may be dynamically assigned to the identification of that word based on the language model.

In some embodiments, both of the acoustic model and the language model may always be utilized in combination for each spoken word, regardless of whether the per-word determination is made in a manner that gives greater weight to relying more on the acoustic model or to the language model to identify a word. Thus, the beam searches associated with such use of a language model implemented with an n-gram corpus may always be performed regardless of such dynamic per-word assignment of relative weighting. In some of such embodiments, it may be that the probability (and/or another measure or statistic) associated with the word identified by the language model is used as an input to the dynamic per-word relative weighting in addition to the degree of perplexity derived for the probability distributions for the corresponding graphemes.

Alternatively, in other embodiments, it may be that the language model is not used to provide any input to the dynamic per-word relative weighting. In such other embodiments, such a situation may provide the opportunity to entirely refrain from consuming processing and/or storage resources to perform beam searches associated with using the language model if the results of the dynamic per-word relative weighting are such that the results of using the language model will not be used. In this way, use of the language model may be made contingent on such dynamic per-word relative weighting.

Regarding the use of a language model as part of the speech-to-text processing operations, as will be readily recognized by those skilled in the art, when using a language model based on a corpus of n-grams, it is generally accepted that a larger n-gram corpus is capable of achieving higher accuracies in speech-to-text operations than a smaller one. However, as will also be familiar to those skilled in the art, each increase of one word in the quantity of words that may be included in each n-gram can result in an exponential increase in the size of the n-gram corpus. As a result, it has become commonplace to limit the quantity of words that may be included in each n-gram to 4, 5 or 6 words to avoid so overtaxing available processing and/or storage resources of typical computing devices as to become impractical for use. To overcome such limitations, the processing and storage resources of multiple node devices may be employed in particular ways that make more efficient use of distributed processing to make the use of a larger n-gram corpus more practical.

More specifically, in preparation for performing beam searches of a relatively large n-gram corpus of an n-gram language model, complete copies of such a relatively large n-gram corpus may be distributed among the multiple node devices such that each is caused to locally store the complete n-gram corpus. Proceeding in temporal order through probability distributions of graphemes that may have been pronounced throughout speech segment, the control device may derive candidate sets of n-grams to be searched for within the n-gram corpus to retrieve their corresponding probabilities. As each such n-gram candidate set is derived, the control device may provide it to all of the node devices 2300 to which the n-gram corpus has been provided to enable beam searches for each of the different candidate n-grams to be searched for, at least partially in parallel.

As part of causing different ones of the n-grams to be searched for by different ones of the node devices, a modulo calculation may be used based on identifiers assigned to each of the node devices to enable each node device to independently determine which one(s) of the n-grams within the n-gram candidate set will be searched for therein. Alternatively, the n-gram searches may be distributed among multiple execution threads of processor(s) within a single device (e.g., the control device or a single node device). As each of the node devices completes the beam search(es) for its corresponding one(s) of the candidate n-grams, indications of the relative probabilities of occurrence for each n-gram may be provided to the control device to enable the control device to identify the next word that was most likely spoken in the speech segment, and accordingly, to identify the next word to be added to the transcript of what was spoken in the speech audio. Upon completion of the transcript, the transcript may be stored by the control device within the one or more storage devices as a text data set that may be subsequently retrieved and analyzed to derive various insights therefrom, as previously discussed.

In a further effort to make the use of a relatively large n-gram corpus more practical, the corpus data sets may be generated to employ a two-dimensional (2D) array data structure, instead of the more conventional ASCII text file data structure of the widely known and used “ARPA” text format originally introduced by Doug B. Paul of the Massachusetts Institute of Technology. Avoiding the use of such a relatively unstructured text format obviates the need to use text parsing routines that can greatly decrease the speed of access to individual n-grams, and/or individual words within individual n-grams. In this way, the speed with which the n-gram corpus is able to be generated, put through deduplication, and used in beam searches may be greatly increased.

Still further, in deriving probabilities for the occurrence of each n-gram, a novel technique may be used for deriving a backoff value that is relatively simple to perform, and that is better suited to the larger n-gram corpuses that may be made practical to use by way of the various approaches described herein.

Regardless of the exact manner in which each word spoken in speech audio is identified through use of an acoustic model and/or through the use of a language model, and regardless of the size and/or format of the n-gram corpus that may be used, the length of transcript(s) that are generated from speech audio may advantageously or adversely affect automated text analyses that may be subsequently performed in post-processing (e.g., analyses to identify topics, to identify sentiments of topics, and/or to identify other related pieces of speech audio and/or transcripts generated therefrom). From experimentation and observation, it has been found that, generally, many forms of automated text analyses are able to be more successfully used with longer transcripts.

More specifically, it has been found that shorter transcripts tend to cause an overemphasis on the more frequently used words in a language, even after removal of non-content stopwords, with the result that analyses to derive topics and/or other insights of a transcript tend to produce less useful results. To counteract this, in some embodiments, all of the text of speech audio on which speech-to-text processing has been performed may be stored and/or otherwise handled as a single transcript, thereby increasing the likelihood of generating longer transcripts. However, where the speech audio is sufficiently long as to include multiple presentations and/or conversations on unrelated subjects, automated text analyses performed on a single transcript encompassing such lengthy and varied speech audio may also produce less useful results. Thus, in some embodiments, rules concerning lengths of transcripts and/or acoustic features such as relatively lengthy pauses may be used to bring about the generation of lengths and/or quantities of transcripts for each piece of speech audio that are more amenable to providing useful results from automated text analyses.

Turning to the text analytics post-processing operations, the resulting one or more transcripts of the speech audio may be provided to one or more text analyzers to derive, based on such factors as the frequency with which each word was spoken, such insights as topic(s) spoken about, relative importance of topics, sentiments expressed concerning each topic, etc. It may be that each such stored transcript(s) may be accompanied in storage with metadata indicative of such insights. Alternatively, or additionally, it may be that such insights are used to identify other transcript(s) generated from other pieces of speech audio that are deemed to be related.

In embodiments in which a distributed processing system is used that includes multiple node devices, various one(s) of the pre-processing, text-to-speech processing and/or post-processing operations within the framework may be performed in a manner that is distributed across those multiple node devices to improve the efficiency with which those operations are able to be performed. As will be explained in greater detail, such improvements in efficiency may also enable improvements in the handling of data such that greater use may be made of contextual information to provide improved results.

By way of example, each of the different pause detection techniques may be performed within a separate one of the node devices, at least partially in parallel, such that a different one of the corresponding set of likely sentence pauses may be independently derived within each such node device.

Also by way of example, multiple instances of the feature detector may be executed across the multiple node devices, and the speech segments may be distributed thereamong to enable speech detection to be performed with multiple ones of the speech segments at least partially in parallel. Further, along with the multiple instances of the feature detector, multiple instances of the acoustic model may be instantiated across the multiple node devices, thereby enabling the feature vectors derived from a speech segment by an instance of the feature detector within a node device to be directly provided to the corresponding instance of the acoustic model within the node device to enable the derivation of the set of probability distributions that correspond to that speech segment.

Also, by way of example, multiple copies of the n-gram corpus may be distributed among the multiple node devices to enable each beam search across multiple n-grams for each next word in a sentence to be performed in a distributed manner without need of communication among the node devices.

With general reference to notations and nomenclature used herein, portions of the detailed description that follows may be presented in terms of program procedures executed by a processor of a machine or of multiple networked machines. These procedural descriptions and representations are used by those skilled in the art to convey the substance of their work most effectively to others skilled in the art. A procedure is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. These operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical communications capable of being stored, transferred, combined, compared, and otherwise manipulated. It proves convenient at times, principally for reasons of common usage, to refer to what is communicated as bits, values, elements, symbols, characters, terms, numbers, or the like. It should be noted, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to those quantities.

Further, these manipulations are often referred to in terms, such as adding or comparing, which are commonly associated with mental operations performed by a human operator. However, no such capability of a human operator is necessary, or desirable in most cases, in any of the operations described herein that form part of one or more embodiments. Rather, these operations are machine operations. Useful machines for performing operations of various embodiments include machines selectively activated or configured by a routine stored within that is written in accordance with the teachings herein, and/or include apparatus specially constructed for the required purpose. Various embodiments also relate to apparatus or systems for performing these operations. These apparatus may be specially constructed for the required purpose or may include a general-purpose computer. The required structure for a variety of these machines will appear from the description given.

Reference is now made to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding thereof. It may be evident, however, that the novel embodiments can be practiced without these specific details. In other instances, well known structures and devices are shown in block diagram form in order to facilitate a description thereof. The intention is to cover all modifications, equivalents, and alternatives within the scope of the claims.

Systems depicted in some of the figures may be provided in various configurations. In some embodiments, the systems may be configured as a distributed system where one or more components of the system are distributed across one or more networks in a cloud computing system and/or a fog computing system.

FIG. 1 is a block diagram that provides an illustration of the hardware components of a data transmission network 100, according to embodiments of the present technology. Data transmission network 100 is a specialized computer system that may be used for processing large amounts of data where a large number of computer processing cycles are required.

Data transmission network 100 may also include computing environment 114. Computing environment 114 may be a specialized computer or other machine that processes the data received within the data transmission network 100. Data transmission network 100 also includes one or more network devices 102. Network devices 102 may include client devices that attempt to communicate with computing environment 114. For example, network devices 102 may send data to the computing environment 114 to be processed, may send signals to the computing environment 114 to control different aspects of the computing environment or the data it is processing, among other reasons. Network devices 102 may interact with the computing environment 114 through a number of ways, such as, for example, over one or more networks 108. As shown in FIG. 1 , computing environment 114 may include one or more other systems. For example, computing environment 114 may include a database system 118 and/or a communications grid 120.

In other embodiments, network devices may provide a large amount of data, either all at once or streaming over a period of time (e.g., using event stream processing (ESP), described further with respect to FIGS. 8-10 ), to the computing environment 114 via networks 108. For example, network devices 102 may include network computers, sensors, databases, or other devices that may transmit or otherwise provide data to computing environment 114. For example, network devices may include local area network devices, such as routers, hubs, switches, or other computer networking devices. These devices may provide a variety of stored or generated data, such as network data or data specific to the network devices themselves. Network devices may also include sensors that monitor their environment or other devices to collect data regarding that environment or those devices, and such network devices may provide data they collect over time. Network devices may also include devices within the internet of things, such as devices within a home automation network. Some of these devices may be referred to as edge devices and may involve edge computing circuitry. Data may be transmitted by network devices directly to computing environment 114 or to network-attached data stores, such as network-attached data stores 110 for storage so that the data may be retrieved later by the computing environment 114 or other portions of data transmission network 100.

Data transmission network 100 may also include one or more network-attached data stores 110. Network-attached data stores 110 are used to store data to be processed by the computing environment 114 as well as any intermediate or final data generated by the computing system in non-volatile memory. However, in certain embodiments, the configuration of the computing environment 114 allows its operations to be performed such that intermediate and final data results can be stored solely in volatile memory (e.g., RAM), without a requirement that intermediate or final data results be stored to non-volatile types of memory (e.g., disk). This can be useful in certain situations, such as when the computing environment 114 receives ad hoc queries from a user and when responses, which are generated by processing large amounts of data, need to be generated on-the-fly. In this non-limiting situation, the computing environment 114 may be configured to retain the processed information within memory so that responses can be generated for the user at different levels of detail as well as allow a user to interactively query against this information.

Network-attached data stores may store a variety of different types of data organized in a variety of different ways and from a variety of different sources. For example, network-attached data storage may include storage other than primary storage located within computing environment 114 that is directly accessible by processors located therein. Network-attached data storage may include secondary, tertiary or auxiliary storage, such as large hard drives, servers, virtual memory, among other types. Storage devices may include portable or non-portable storage devices, optical storage devices, and various other mediums capable of storing, containing data. A machine-readable storage medium or computer-readable storage medium may include a non-transitory medium in which data can be stored and that does not include carrier waves and/or transitory electronic signals. Examples of a non-transitory medium may include, for example, a magnetic disk or tape, optical storage media such as compact disk or digital versatile disk, flash memory, memory or memory devices. A computer-program product may include code and/or machine-executable instructions that may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, among others. Furthermore, the data stores may hold a variety of different types of data. For example, network-attached data stores 110 may hold unstructured (e.g., raw) data, such as manufacturing data (e.g., a database containing records identifying products being manufactured with parameter data for each product, such as colors and models) or product sales databases (e.g., a database containing individual data records identifying details of individual product sales).

The unstructured data may be presented to the computing environment 114 in different forms such as a flat file or a conglomerate of data records and may have data values and accompanying time stamps. The computing environment 114 may be used to analyze the unstructured data in a variety of ways to determine the best way to structure (e.g., hierarchically) that data, such that the structured data is tailored to a type of further analysis that a user wishes to perform on the data. For example, after being processed, the unstructured time stamped data may be aggregated by time (e.g., into daily time period units) to generate time series data and/or structured hierarchically according to one or more dimensions (e.g., parameters, attributes, and/or variables). For example, data may be stored in a hierarchical data structure, such as a ROLAP OR MOLAP database, or may be stored in another tabular form, such as in a flat-hierarchy form.

Data transmission network 100 may also include one or more server farms 106. Computing environment 114 may route select communications or data to the one or more sever farms 106 or one or more servers within the server farms. Server farms 106 can be configured to provide information in a predetermined manner. For example, server farms 106 may access data to transmit in response to a communication. Server farms 106 may be separately housed from each other device within data transmission network 100, such as computing environment 114, and/or may be part of a device or system.

Server farms 106 may host a variety of different types of data processing as part of data transmission network 100. Server farms 106 may receive a variety of different data from network devices, from computing environment 114, from cloud network 116, or from other sources. The data may have been obtained or collected from one or more sensors, as inputs from a control database, or may have been received as inputs from an external system or device. Server farms 106 may assist in processing the data by turning raw data into processed data based on one or more rules implemented by the server farms. For example, sensor data may be analyzed to determine changes in an environment over time or in real-time.

Data transmission network 100 may also include one or more cloud networks 116. Cloud network 116 may include a cloud infrastructure system that provides cloud services. In certain embodiments, services provided by the cloud network 116 may include a host of services that are made available to users of the cloud infrastructure system on demand. Cloud network 116 is shown in FIG. 1 as being connected to computing environment 114 (and therefore having computing environment 114 as its client or user), but cloud network 116 may be connected to or utilized by any of the devices in FIG. 1 . Services provided by the cloud network can dynamically scale to meet the needs of its users. The cloud network 116 may include one or more computers, servers, and/or systems. In some embodiments, the computers, servers, and/or systems that make up the cloud network 116 are different from the user's own on-premises computers, servers, and/or systems. For example, the cloud network 116 may host an application, and a user may, via a communication network such as the Internet, on demand, order and use the application.

While each device, server and system in FIG. 1 is shown as a single device, it will be appreciated that multiple devices may instead be used. For example, a set of network devices can be used to transmit various communications from a single user, or remote server 140 may include a server stack. As another example, data may be processed as part of computing environment 114.

Each communication within data transmission network 100 (e.g., between client devices, between servers 106 and computing environment 114 or between a server and a device) may occur over one or more networks 108. Networks 108 may include one or more of a variety of different types of networks, including a wireless network, a wired network, or a combination of a wired and wireless network. Examples of suitable networks include the Internet, a personal area network, a local area network (LAN), a wide area network (WAN), or a wireless local area network (WLAN). A wireless network may include a wireless interface or combination of wireless interfaces. As an example, a network in the one or more networks 108 may include a short-range communication channel, such as a BLUETOOTH® communication channel or a BLUETOOTH® Low Energy communication channel. A wired network may include a wired interface. The wired and/or wireless networks may be implemented using routers, access points, bridges, gateways, or the like, to connect devices in the network 114, as will be further described with respect to FIG. 2 . The one or more networks 108 can be incorporated entirely within or can include an intranet, an extranet, or a combination thereof. In one embodiment, communications between two or more systems and/or devices can be achieved by a secure communications protocol, such as secure sockets layer (SSL) or transport layer security (TLS). In addition, data and/or transactional details may be encrypted.

Some aspects may utilize the Internet of Things (IoT), where things (e.g., machines, devices, phones, sensors) can be connected to networks and the data from these things can be collected and processed within the things and/or external to the things. For example, the IoT can include sensors in many different devices, and high value analytics can be applied to identify hidden relationships and drive increased efficiencies. This can apply to both big data analytics and real-time (e.g., ESP) analytics. This will be described further below with respect to FIG. 2 .

As noted, computing environment 114 may include a communications grid 120 and a transmission network database system 118. Communications grid 120 may be a grid-based computing system for processing large amounts of data. The transmission network database system 118 may be for managing, storing, and retrieving large amounts of data that are distributed to and stored in the one or more network-attached data stores 110 or other data stores that reside at different locations within the transmission network database system 118. The compute nodes in the grid-based computing system 120 and the transmission network database system 118 may share the same processor hardware, such as processors that are located within computing environment 114.

FIG. 2 illustrates an example network including an example set of devices communicating with each other over an exchange system and via a network, according to embodiments of the present technology. As noted, each communication within data transmission network 100 may occur over one or more networks. System 200 includes a network device 204 configured to communicate with a variety of types of client devices, for example client devices 230, over a variety of types of communication channels.

As shown in FIG. 2 , network device 204 can transmit a communication over a network (e.g., a cellular network via a base station 210). The communication can be routed to another network device, such as network devices 205-209, via base station 210. The communication can also be routed to computing environment 214 via base station 210. For example, network device 204 may collect data either from its surrounding environment or from other network devices (such as network devices 205-209) and transmit that data to computing environment 214.

Although network devices 204-209 are shown in FIG. 2 as a mobile phone, laptop computer, tablet computer, temperature sensor, motion sensor, and audio sensor respectively, the network devices may be or include sensors that are sensitive to detecting aspects of their environment. For example, the network devices may include sensors such as water sensors, power sensors, electrical current sensors, chemical sensors, optical sensors, pressure sensors, geographic or position sensors (e.g., GPS), velocity sensors, acceleration sensors, flow rate sensors, among others. Examples of characteristics that may be sensed include force, torque, load, strain, position, temperature, air pressure, fluid flow, chemical properties, resistance, electromagnetic fields, radiation, irradiance, proximity, acoustics, moisture, distance, speed, vibrations, acceleration, electrical potential, and electrical current, among others. The sensors may be mounted to various components used as part of a variety of different types of systems (e.g., an oil drilling operation). The network devices may detect and record data related to the environment that it monitors and transmit that data to computing environment 214.

As noted, one type of system that may include various sensors that collect data to be processed and/or transmitted to a computing environment according to certain embodiments includes an oil drilling system. For example, the one or more drilling operation sensors may include surface sensors that measure a hook load, a fluid rate, a temperature and a density in and out of the wellbore, a standpipe pressure, a surface torque, a rotation speed of a drill pipe, a rate of penetration, a mechanical specific energy, etc. and downhole sensors that measure a rotation speed of a bit, fluid densities, downhole torque, downhole vibration (axial, tangential, lateral), a weight applied at a drill bit, an annular pressure, a differential pressure, an azimuth, an inclination, a dog leg severity, a measured depth, a vertical depth, a downhole temperature, etc. Besides the raw data collected directly by the sensors, other data may include parameters either developed by the sensors or assigned to the system by a client or other controlling device. For example, one or more drilling operation control parameters may control settings such as a mud motor speed to flow ratio, a bit diameter, a predicted formation top, seismic data, weather data, etc. Other data may be generated using physical models such as an earth model, a weather model, a seismic model, a bottom hole assembly model, a well plan model, an annular friction model, etc. In addition to sensor and control settings, predicted outputs, of for example, the rate of penetration, mechanical specific energy, hook load, flow in fluid rate, flow out fluid rate, pump pressure, surface torque, rotation speed of the drill pipe, annular pressure, annular friction pressure, annular temperature, equivalent circulating density, etc. may also be stored in the data warehouse.

In another example, another type of system that may include various sensors that collect data to be processed and/or transmitted to a computing environment according to certain embodiments includes a home automation or similar automated network in a different environment, such as an office space, school, public space, sports venue, or a variety of other locations. Network devices in such an automated network may include network devices that allow a user to access, control, and/or configure various home appliances located within the user's home (e.g., a television, radio, light, fan, humidifier, sensor, microwave, iron, and/or the like), or outside of the user's home (e.g., exterior motion sensors, exterior lighting, garage door openers, sprinkler systems, or the like). For example, network device 102 may include a home automation switch that may be coupled with a home appliance. In another embodiment, a network device can allow a user to access, control, and/or configure devices, such as office-related devices (e.g., copy machine, printer, or fax machine), audio and/or video related devices (e.g., a receiver, a speaker, a projector, a DVD player, or a television), media-playback devices (e.g., a compact disc player, a CD player, or the like), computing devices (e.g., a home computer, a laptop computer, a tablet, a personal digital assistant (PDA), a computing device, or a wearable device), lighting devices (e.g., a lamp or recessed lighting), devices associated with a security system, devices associated with an alarm system, devices that can be operated in an automobile (e.g., radio devices, navigation devices), and/or the like. Data may be collected from such various sensors in raw form, or data may be processed by the sensors to create parameters or other data either developed by the sensors based on the raw data or assigned to the system by a client or other controlling device.

In another example, another type of system that may include various sensors that collect data to be processed and/or transmitted to a computing environment according to certain embodiments includes a power or energy grid. A variety of different network devices may be included in an energy grid, such as various devices within one or more power plants, energy farms (e.g., wind farm, solar farm, among others) energy storage facilities, factories, homes and businesses of consumers, among others. One or more of such devices may include one or more sensors that detect energy gain or loss, electrical input or output or loss, and a variety of other efficiencies. These sensors may collect data to inform users of how the energy grid, and individual devices within the grid, may be functioning and how they may be made more efficient.

Network device sensors may also perform processing on data it collects before transmitting the data to the computing environment 114, or before deciding whether to transmit data to the computing environment 114. For example, network devices may determine whether data collected meets certain rules, for example by comparing data or values calculated from the data and comparing that data to one or more thresholds. The network device may use this data and/or comparisons to determine if the data should be transmitted to the computing environment 214 for further use or processing.

Computing environment 214 may include machines 220 and 240. Although computing environment 214 is shown in FIG. 2 as having two machines, 220 and 240, computing environment 214 may have only one machine or may have more than two machines. The machines that make up computing environment 214 may include specialized computers, servers, or other machines that are configured to individually and/or collectively process large amounts of data. The computing environment 214 may also include storage devices that include one or more databases of structured data, such as data organized in one or more hierarchies, or unstructured data. The databases may communicate with the processing devices within computing environment 214 to distribute data to them. Since network devices may transmit data to computing environment 214, that data may be received by the computing environment 214 and subsequently stored within those storage devices. Data used by computing environment 214 may also be stored in data stores 235, which may also be a part of or connected to computing environment 214.

Computing environment 214 can communicate with various devices via one or more routers 225 or other inter-network or intra-network connection components. For example, computing environment 214 may communicate with devices 230 via one or more routers 225. Computing environment 214 may collect, analyze and/or store data from or pertaining to communications, client device operations, client rules, and/or user-associated actions stored at one or more data stores 235. Such data may influence communication routing to the devices within computing environment 214, how data is stored or processed within computing environment 214, among other actions.

Notably, various other devices can further be used to influence communication routing and/or processing between devices within computing environment 214 and with devices outside of computing environment 214. For example, as shown in FIG. 2 , computing environment 214 may include a web server 240. Thus, computing environment 214 can retrieve data of interest, such as client information (e.g., product information, client rules, etc.), technical product details, news, current or predicted weather, and so on.

In addition to computing environment 214 collecting data (e.g., as received from network devices, such as sensors, and client devices or other sources) to be processed as part of a big data analytics project, it may also receive data in real time as part of a streaming analytics environment. As noted, data may be collected using a variety of sources as communicated via different kinds of networks or locally. Such data may be received on a real-time streaming basis. For example, network devices may receive data periodically from network device sensors as the sensors continuously sense, monitor and track changes in their environments. Devices within computing environment 214 may also perform pre-analysis on data it receives to determine if the data received should be processed as part of an ongoing project. The data received and collected by computing environment 214, no matter what the source or method or timing of receipt, may be processed over a period of time for a client to determine results data based on the client's needs and rules.

FIG. 3 illustrates a representation of a conceptual model of a communications protocol system, according to embodiments of the present technology. More specifically, FIG. 3 identifies operation of a computing environment in an Open Systems Interaction model that corresponds to various connection components. The model 300 shows, for example, how a computing environment, such as computing environment 314 (or computing environment 214 in FIG. 2 ) may communicate with other devices in its network, and control how communications between the computing environment and other devices are executed and under what conditions.

The model can include layers 301-307. The layers are arranged in a stack. Each layer in the stack serves the layer one level higher than it (except for the application layer, which is the highest layer), and is served by the layer one level below it (except for the physical layer, which is the lowest layer). The physical layer is the lowest layer because it receives and transmits raw bites of data and is the farthest layer from the user in a communications system. On the other hand, the application layer is the highest layer because it interacts directly with a software application.

As noted, the model includes a physical layer 301. Physical layer 301 represents physical communication and can define parameters of that physical communication. For example, such physical communication may come in the form of electrical, optical, or electromagnetic signals. Physical layer 301 also defines protocols that may control communications within a data transmission network.

Link layer 302 defines links and mechanisms used to transmit (i.e., move) data across a network. The link layer 302 manages node-to-node communications, such as within a grid computing environment. Link layer 302 can detect and correct errors (e.g., transmission errors in the physical layer 301). Link layer 302 can also include a media access control (MAC) layer and logical link control (LLC) layer.

Network layer 303 defines the protocol for routing within a network. In other words, the network layer coordinates transferring data across nodes in a same network (e.g., such as a grid computing environment). Network layer 303 can also define the processes used to structure local addressing within the network.

Transport layer 304 can manage the transmission of data and the quality of the transmission and/or receipt of that data. Transport layer 304 can provide a protocol for transferring data, such as, for example, a Transmission Control Protocol (TCP). Transport layer 304 can assemble and disassemble data frames for transmission. The transport layer can also detect transmission errors occurring in the layers below it.

Session layer 305 can establish, maintain, and manage communication connections between devices on a network. In other words, the session layer controls the dialogues or nature of communications between network devices on the network. The session layer may also establish checkpointing, adjournment, termination, and restart procedures.

Presentation layer 306 can provide translation for communications between the application and network layers. In other words, this layer may encrypt, decrypt and/or format data based on data types and/or encodings known to be accepted by an application or network layer.

Application layer 307 interacts directly with software applications and end users, and manages communications between them. Application layer 307 can identify destinations, local resource states or availability and/or communication content or formatting using the applications.

Intra-network connection components 321 and 322 are shown to operate in lower levels, such as physical layer 301 and link layer 302, respectively. For example, a hub can operate in the physical layer, a switch can operate in the link layer, and a router can operate in the network layer. Inter-network connection components 323 and 328 are shown to operate on higher levels, such as layers 303-307. For example, routers can operate in the network layer and network devices can operate in the transport, session, presentation, and application layers.

As noted, a computing environment 314 can interact with and/or operate on, in various embodiments, one, more, all or any of the various layers. For example, computing environment 314 can interact with a hub (e.g., via the link layer) so as to adjust which devices the hub communicates with. The physical layer may be served by the link layer, so it may implement such data from the link layer. For example, the computing environment 314 may control which devices it will receive data from. For example, if the computing environment 314 knows that a certain network device has turned off, broken, or otherwise become unavailable or unreliable, the computing environment 314 may instruct the hub to prevent any data from being transmitted to the computing environment 314 from that network device. Such a process may be beneficial to avoid receiving data that is inaccurate or that has been influenced by an uncontrolled environment. As another example, computing environment 314 can communicate with a bridge, switch, router or gateway and influence which device within the system (e.g., system 200) the component selects as a destination. In some embodiments, computing environment 314 can interact with various layers by exchanging communications with equipment operating on a particular layer by routing or modifying existing communications. In another embodiment, such as in a grid computing environment, a node may determine how data within the environment should be routed (e.g., which node should receive certain data) based on certain parameters or information provided by other layers within the model.

As noted, the computing environment 314 may be a part of a communications grid environment, the communications of which may be implemented as shown in the protocol of FIG. 3 . For example, referring back to FIG. 2 , one or more of machines 220 and 240 may be part of a communications grid computing environment. A gridded computing environment may be employed in a distributed system with non-interactive workloads where data resides in memory on the machines, or compute nodes. In such an environment, analytic code, instead of a database management system, controls the processing performed by the nodes. Data is co-located by pre-distributing it to the grid nodes, and the analytic code on each node loads the local data into memory. Each node may be assigned a particular task such as a portion of a processing project, or to organize or control other nodes within the grid.

FIG. 4 illustrates a communications grid computing system 400 including a variety of control and worker nodes, according to embodiments of the present technology. Communications grid computing system 400 includes three control nodes and one or more worker nodes. Communications grid computing system 400 includes control nodes 402, 404, and 406. The control nodes are communicatively connected via communication paths 451, 453, and 455. Therefore, the control nodes may transmit information (e.g., related to the communications grid or notifications), to and receive information from each other. Although communications grid computing system 400 is shown in FIG. 4 as including three control nodes, the communications grid may include more or less than three control nodes.

Communications grid computing system (or just “communications grid”) 400 also includes one or more worker nodes. Shown in FIG. 4 are six worker nodes 410-420. Although FIG. 4 shows six worker nodes, a communications grid according to embodiments of the present technology may include more or less than six worker nodes. The number of worker nodes included in a communications grid may be dependent upon how large the project or data set is being processed by the communications grid, the capacity of each worker node, the time designated for the communications grid to complete the project, among others. Each worker node within the communications grid 400 may be connected (wired or wirelessly, and directly or indirectly) to control nodes 402-406. Therefore, each worker node may receive information from the control nodes (e.g., an instruction to perform work on a project) and may transmit information to the control nodes (e.g., a result from work performed on a project). Furthermore, worker nodes may communicate with each other (either directly or indirectly). For example, worker nodes may transmit data between each other related to a job being performed or an individual task within a job being performed by that worker node. However, in certain embodiments, worker nodes may not, for example, be connected (communicatively or otherwise) to certain other worker nodes. In an embodiment, worker nodes may only be able to communicate with the control node that controls it and may not be able to communicate with other worker nodes in the communications grid, whether they are other worker nodes controlled by the control node that controls the worker node, or worker nodes that are controlled by other control nodes in the communications grid.

A control node may connect with an external device with which the control node may communicate (e.g., a grid user, such as a server or computer, may connect to a controller of the grid). For example, a server or computer may connect to control nodes and may transmit a project or job to the node. The project may include a data set. The data set may be of any size. Once the control node receives such a project including a large data set, the control node may distribute the data set or projects related to the data set to be performed by worker nodes. Alternatively, for a project including a large data set, the data set may be received or stored by a machine other than a control node (e.g., a HADOOP® standard-compliant data node employing the HADOOP® Distributed File System, or HDFS).

Control nodes may maintain knowledge of the status of the nodes in the grid (i.e., grid status information), accept work requests from clients, subdivide the work across worker nodes, and coordinate the worker nodes, among other responsibilities. Worker nodes may accept work requests from a control node and provide the control node with results of the work performed by the worker node. A grid may be started from a single node (e.g., a machine, computer, server, etc.). This first node may be assigned or may start as the primary control node that will control any additional nodes that enter the grid.

When a project is submitted for execution (e.g., by a client or a controller of the grid) it may be assigned to a set of nodes. After the nodes are assigned to a project, a data structure (i.e., a communicator) may be created. The communicator may be used by the project for information to be shared between the project codes running on each node. A communication handle may be created on each node. A handle, for example, is a reference to the communicator that is valid within a single process on a single node, and the handle may be used when requesting communications between nodes.

A control node, such as control node 402, may be designated as the primary control node. A server, computer or other external device may connect to the primary control node. Once the control node receives a project, the primary control node may distribute portions of the project to its worker nodes for execution. For example, when a project is initiated on communications grid 400, primary control node 402 controls the work to be performed for the project in order to complete the project as requested or instructed. The primary control node may distribute work to the worker nodes based on various factors, such as which subsets or portions of projects may be completed most efficiently and in the correct amount of time. For example, a worker node may perform analysis on a portion of data that is already local (e.g., stored on) the worker node. The primary control node also coordinates and processes the results of the work performed by each worker node after each worker node executes and completes its job. For example, the primary control node may receive a result from one or more worker nodes, and the control node may organize (e.g., collect and assemble) the results received and compile them to produce a complete result for the project received from the end user.

Any remaining control nodes, such as control nodes 404 and 406, may be assigned as backup control nodes for the project. In an embodiment, backup control nodes may not control any portion of the project. Instead, backup control nodes may serve as a backup for the primary control node and take over as primary control node if the primary control node were to fail. If a communications grid were to include only a single control node, and the control node were to fail (e.g., the control node is shut off or breaks) then the communications grid as a whole may fail and any project or job being run on the communications grid may fail and may not complete. While the project may be run again, such a failure may cause a delay (severe delay in some cases, such as overnight delay) in completion of the project. Therefore, a grid with multiple control nodes, including a backup control node, may be beneficial.

To add another node or machine to the grid, the primary control node may open a pair of listening sockets, for example. A socket may be used to accept work requests from clients, and the second socket may be used to accept connections from other grid nodes. The primary control node may be provided with a list of other nodes (e.g., other machines, computers, servers) that will participate in the grid, and the role that each node will fill in the grid. Upon startup of the primary control node (e.g., the first node on the grid), the primary control node may use a network protocol to start the server process on every other node in the grid. Command line parameters, for example, may inform each node of one or more pieces of information, such as: the role that the node will have in the grid, the host name of the primary control node, the port number on which the primary control node is accepting connections from peer nodes, among others. The information may also be provided in a configuration file, transmitted over a secure shell tunnel, recovered from a configuration server, among others. While the other machines in the grid may not initially know about the configuration of the grid, that information may also be sent to each other node by the primary control node. Updates of the grid information may also be subsequently sent to those nodes.

For any control node other than the primary control node added to the grid, the control node may open three sockets. The first socket may accept work requests from clients, the second socket may accept connections from other grid members, and the third socket may connect (e.g., permanently) to the primary control node. When a control node (e.g., primary control node) receives a connection from another control node, it first checks to see if the peer node is in the list of configured nodes in the grid. If it is not on the list, the control node may clear the connection. If it is on the list, it may then attempt to authenticate the connection. If authentication is successful, the authenticating node may transmit information to its peer, such as the port number on which a node is listening for connections, the host name of the node, information about how to authenticate the node, among other information. When a node, such as the new control node, receives information about another active node, it will check to see if it already has a connection to that other node. If it does not have a connection to that node, it may then establish a connection to that control node.

Any worker node added to the grid may establish a connection to the primary control node and any other control nodes on the grid. After establishing the connection, it may authenticate itself to the grid (e.g., any control nodes, including both primary and backup, or a server or user controlling the grid). After successful authentication, the worker node may accept configuration information from the control node.

When a node joins a communications grid (e.g., when the node is powered on or connected to an existing node on the grid or both), the node is assigned (e.g., by an operating system of the grid) a universally unique identifier (UUID). This unique identifier may help other nodes and external entities (devices, users, etc.) to identify the node and distinguish it from other nodes. When a node is connected to the grid, the node may share its unique identifier with the other nodes in the grid. Since each node may share its unique identifier, each node may know the unique identifier of every other node on the grid. Unique identifiers may also designate a hierarchy of each of the nodes (e.g., backup control nodes) within the grid. For example, the unique identifiers of each of the backup control nodes may be stored in a list of backup control nodes to indicate an order in which the backup control nodes will take over for a failed primary control node to become a new primary control node. However, a hierarchy of nodes may also be determined using methods other than using the unique identifiers of the nodes. For example, the hierarchy may be predetermined, or may be assigned based on other predetermined factors.

The grid may add new machines at any time (e.g., initiated from any control node). Upon adding a new node to the grid, the control node may first add the new node to its table of grid nodes. The control node may also then notify every other control node about the new node. The nodes receiving the notification may acknowledge that they have updated their configuration information.

Primary control node 402 may, for example, transmit one or more communications to backup control nodes 404 and 406 (and, for example, to other control or worker nodes within the communications grid). Such communications may be sent periodically, at fixed time intervals, between known fixed stages of the project's execution, among other protocols. The communications transmitted by primary control node 402 may be of varied types and may include a variety of types of information. For example, primary control node 402 may transmit snapshots (e.g., status information) of the communications grid so that backup control node 404 always has a recent snapshot of the communications grid. The snapshot or grid status may include, for example, the structure of the grid (including, for example, the worker nodes in the grid, unique identifiers of the nodes, or their relationships with the primary control node) and the status of a project (including, for example, the status of each worker node's portion of the project). The snapshot may also include analysis or results received from worker nodes in the communications grid. The backup control nodes may receive and store the backup data received from the primary control node. The backup control nodes may transmit a request for such a snapshot (or other information) from the primary control node, or the primary control node may send such information periodically to the backup control nodes.

As noted, the backup data may allow the backup control node to take over as primary control node if the primary control node fails without requiring the grid to start the project over from scratch. If the primary control node fails, the backup control node that will take over as primary control node may retrieve the most recent version of the snapshot received from the primary control node and use the snapshot to continue the project from the stage of the project indicated by the backup data. This may prevent failure of the project as a whole.

A backup control node may use various methods to determine that the primary control node has failed. In one example of such a method, the primary control node may transmit (e.g., periodically) a communication to the backup control node that indicates that the primary control node is working and has not failed, such as a heartbeat communication. The backup control node may determine that the primary control node has failed if the backup control node has not received a heartbeat communication for a certain predetermined period of time. Alternatively, a backup control node may also receive a communication from the primary control node itself (before it failed) or from a worker node that the primary control node has failed, for example because the primary control node has failed to communicate with the worker node.

Different methods may be performed to determine which backup control node of a set of backup control nodes (e.g., backup control nodes 404 and 406) will take over for failed primary control node 402 and become the new primary control node. For example, the new primary control node may be chosen based on a ranking or “hierarchy” of backup control nodes based on their unique identifiers. In an alternative embodiment, a backup control node may be assigned to be the new primary control node by another device in the communications grid or from an external device (e.g., a system infrastructure or an end user, such as a server or computer, controlling the communications grid). In another alternative embodiment, the backup control node that takes over as the new primary control node may be designated based on bandwidth or other statistics about the communications grid.

A worker node within the communications grid may also fail. If a worker node fails, work being performed by the failed worker node may be redistributed amongst the operational worker nodes. In an alternative embodiment, the primary control node may transmit a communication to each of the operable worker nodes still on the communications grid that each of the worker nodes should purposefully fail also. After each of the worker nodes fail, they may each retrieve their most recent saved checkpoint of their status and restart the project from that checkpoint to minimize lost progress on the project being executed.

FIG. 5 illustrates a flow chart showing an example process 500 for adjusting a communications grid or a work project in a communications grid after a failure of a node, according to embodiments of the present technology. The process may include, for example, receiving grid status information including a project status of a portion of a project being executed by a node in the communications grid, as described in operation 502. For example, a control node (e.g., a backup control node connected to a primary control node and a worker node on a communications grid) may receive grid status information, where the grid status information includes a project status of the primary control node or a project status of the worker node. The project status of the primary control node and the project status of the worker node may include a status of one or more portions of a project being executed by the primary and worker nodes in the communications grid. The process may also include storing the grid status information, as described in operation 504. For example, a control node (e.g., a backup control node) may store the received grid status information locally within the control node. Alternatively, the grid status information may be sent to another device for storage where the control node may have access to the information.

The process may also include receiving a failure communication corresponding to a node in the communications grid in operation 506. For example, a node may receive a failure communication including an indication that the primary control node has failed, prompting a backup control node to take over for the primary control node. In an alternative embodiment, a node may receive a failure that a worker node has failed, prompting a control node to reassign the work being performed by the worker node. The process may also include reassigning a node or a portion of the project being executed by the failed node, as described in operation 508. For example, a control node may designate the backup control node as a new primary control node based on the failure communication upon receiving the failure communication. If the failed node is a worker node, a control node may identify a project status of the failed worker node using the snapshot of the communications grid, where the project status of the failed worker node includes a status of a portion of the project being executed by the failed worker node at the failure time.

The process may also include receiving updated grid status information based on the reassignment, as described in operation 510, and transmitting a set of instructions based on the updated grid status information to one or more nodes in the communications grid, as described in operation 512. The updated grid status information may include an updated project status of the primary control node or an updated project status of the worker node. The updated information may be transmitted to the other nodes in the grid to update their stale stored information.

FIG. 6 illustrates a portion of a communications grid computing system 600 including a control node and a worker node, according to embodiments of the present technology. Communications grid 600 computing system includes one control node (control node 602) and one worker node (worker node 610) for purposes of illustration but may include more worker and/or control nodes. The control node 602 is communicatively connected to worker node 610 via communication path 650. Therefore, control node 602 may transmit information (e.g., related to the communications grid or notifications), to and receive information from worker node 610 via path 650.

Similar to in FIG. 4 , communications grid computing system (or just “communications grid”) 600 includes data processing nodes (control node 602 and worker node 610). Nodes 602 and 610 include multi-core data processors. Each node 602 and 610 includes a grid-enabled software component (GESC) 620 that executes on the data processor associated with that node and interfaces with buffer memory 622 also associated with that node. Each node 602 and 610 includes database management software (DBMS) 628 that executes on a database server (not shown) at control node 602 and on a database server (not shown) at worker node 610.

Each node also includes a data store 624. Data stores 624, similar to network-attached data stores 110 in FIG. 1 and data stores 235 in FIG. 2 , are used to store data to be processed by the nodes in the computing environment. Data stores 624 may also store any intermediate or final data generated by the computing system after being processed, for example in non-volatile memory. However, in certain embodiments, the configuration of the grid computing environment allows its operations to be performed such that intermediate and final data results can be stored solely in volatile memory (e.g., RAM), without a requirement that intermediate or final data results be stored to non-volatile types of memory. Storing such data in volatile memory may be useful in certain situations, such as when the grid receives queries (e.g., ad hoc) from a client and when responses, which are generated by processing large amounts of data, need to be generated quickly or on-the-fly. In such a situation, the grid may be configured to retain the data within memory so that responses can be generated at different levels of detail and so that a client may interactively query against this information.

Each node also includes a user-defined function (UDF) 626. The UDF provides a mechanism for the DBMS 628 to transfer data to or receive data from the database stored in the data stores 624 that are managed by the DBMS. For example, UDF 626 can be invoked by the DBMS to provide data to the GESC for processing. The UDF 626 may establish a socket connection (not shown) with the GESC to transfer the data. Alternatively, the UDF 626 can transfer data to the GESC by writing data to shared memory accessible by both the UDF and the GESC.

The GESC 620 at the nodes 602 and 620 may be connected via a network, such as network 108 shown in FIG. 1 . Therefore, nodes 602 and 620 can communicate with each other via the network using a predetermined communication protocol such as, for example, the Message Passing Interface (MPI). Each GESC 620 can engage in point-to-point communication with the GESC at another node or in collective communication with multiple GESCs via the network. The GESC 620 at each node may contain identical (or nearly identical) software instructions. Each node may be capable of operating as either a control node or a worker node. The GESC at the control node 602 can communicate, over a communication path 652, with a client deice 630. More specifically, control node 602 may communicate with client application 632 hosted by the client device 630 to receive queries and to respond to those queries after processing large amounts of data.

DBMS 628 may control the creation, maintenance, and use of database or data structure (not shown) within a nodes 602 or 610. The database may organize data stored in data stores 624. The DBMS 628 at control node 602 may accept requests for data and transfer the appropriate data for the request. With such a process, collections of data may be distributed across multiple physical locations. In this example, each node 602 and 610 stores a portion of the total data managed by the management system in its associated data store 624.

Furthermore, the DBMS may be responsible for protecting against data loss using replication techniques. Replication includes providing a backup copy of data stored on one node on one or more other nodes. Therefore, if one node fails, the data from the failed node can be recovered from a replicated copy residing at another node. However, as described herein with respect to FIG. 4 , data or status information for each node in the communications grid may also be shared with each node on the grid.

FIG. 7 illustrates a flow chart showing an example method 700 for executing a project within a grid computing system, according to embodiments of the present technology. As described with respect to FIG. 6 , the GESC at the control node may transmit data with a client device (e.g., client device 630) to receive queries for executing a project and to respond to those queries after large amounts of data have been processed. The query may be transmitted to the control node, where the query may include a request for executing a project, as described in operation 702. The query can contain instructions on the type of data analysis to be performed in the project and whether the project should be executed using the grid-based computing environment, as shown in operation 704.

To initiate the project, the control node may determine if the query requests use of the grid-based computing environment to execute the project. If the determination is no, then the control node initiates execution of the project in a solo environment (e.g., at the control node), as described in operation 710. If the determination is yes, the control node may initiate execution of the project in the grid-based computing environment, as described in operation 706. In such a situation, the request may include a requested configuration of the grid. For example, the request may include a number of control nodes and a number of worker nodes to be used in the grid when executing the project. After the project has been completed, the control node may transmit results of the analysis yielded by the grid, as described in operation 708. Whether the project is executed in a solo or grid-based environment, the control node provides the results of the project, as described in operation 712.

As noted with respect to FIG. 2 , the computing environments described herein may collect data (e.g., as received from network devices, such as sensors, such as network devices 204-209 in FIG. 2 , and client devices or other sources) to be processed as part of a data analytics project, and data may be received in real time as part of a streaming analytics environment (e.g., ESP). Data may be collected using a variety of sources as communicated via different kinds of networks or locally, such as on a real-time streaming basis. For example, network devices may receive data periodically from network device sensors as the sensors continuously sense, monitor and track changes in their environments. More specifically, an increasing number of distributed applications develop or produce continuously flowing data from distributed sources by applying queries to the data before distributing the data to geographically distributed recipients. An event stream processing engine (ESPE) may continuously apply the queries to the data as it is received and determines which entities should receive the data. Client or other devices may also subscribe to the ESPE or other devices processing ESP data so that they can receive data after processing, based on for example the entities determined by the processing engine. For example, client devices 230 in FIG. 2 may subscribe to the ESPE in computing environment 214. In another example, event subscription devices 1024 a-c, described further with respect to FIG. 10 , may also subscribe to the ESPE. The ESPE may determine or define how input data or event streams from network devices or other publishers (e.g., network devices 204-209 in FIG. 2 ) are transformed into meaningful output data to be consumed by subscribers, such as for example client devices 230 in FIG. 2 .

FIG. 8 illustrates a block diagram including components of an Event Stream Processing Engine (ESPE), according to embodiments of the present technology. ESPE 800 may include one or more projects 802. A project may be described as a second-level container in an engine model managed by ESPE 800 where a thread pool size for the project may be defined by a user. Each project of the one or more projects 802 may include one or more continuous queries 804 that contain data flows, which are data transformations of incoming event streams. The one or more continuous queries 804 may include one or more source windows 806 and one or more derived windows 808.

The ESPE may receive streaming data over a period of time related to certain events, such as events or other data sensed by one or more network devices. The ESPE may perform operations associated with processing data created by the one or more devices. For example, the ESPE may receive data from the one or more network devices 204-209 shown in FIG. 2 . As noted, the network devices may include sensors that sense different aspects of their environments and may collect data over time based on those sensed observations. For example, the ESPE may be implemented within one or more of machines 220 and 240 shown in FIG. 2 . The ESPE may be implemented within such a machine by an ESP application. An ESP application may embed an ESPE with its own dedicated thread pool or pools into its application space where the main application thread can do application-specific work and the ESPE processes event streams at least by creating an instance of a model into processing objects.

The engine container is the top-level container in a model that manages the resources of the one or more projects 802. In an illustrative embodiment, for example, there may be only one ESPE 800 for each instance of the ESP application, and ESPE 800 may have a unique engine name. Additionally, the one or more projects 802 may each have unique project names, and each query may have a unique continuous query name and begin with a uniquely named source window of the one or more source windows 806. ESPE 800 may or may not be persistent.

Continuous query modeling involves defining directed graphs of windows for event stream manipulation and transformation. A window in the context of event stream manipulation and transformation is a processing node in an event stream processing model. A window in a continuous query can perform aggregations, computations, pattern-matching, and other operations on data flowing through the window. A continuous query may be described as a directed graph of source, relational, pattern matching, and procedural windows. The one or more source windows 806 and the one or more derived windows 808 represent continuously executing queries that generate updates to a query result set as new event blocks stream through ESPE 800. A directed graph, for example, is a set of nodes connected by edges, where the edges have a direction associated with them.

An event object may be described as a packet of data accessible as a collection of fields, with at least one of the fields defined as a key or unique identifier (ID). The event object may be created using a variety of formats including binary, alphanumeric, XML, etc. Each event object may include one or more fields designated as a primary identifier (ID) for the event so ESPE 800 can support operation codes (opcodes) for events including insert, update, upsert, and delete. Upsert opcodes update the event if the key field already exists; otherwise, the event is inserted. For illustration, an event object may be a packed binary representation of a set of field values and include both metadata and field data associated with an event. The metadata may include an opcode indicating if the event represents an insert, update, delete, or upsert, a set of flags indicating if the event is a normal, partial-update, or a retention generated event from retention policy management, and a set of microsecond timestamps that can be used for latency measurements.

An event block object may be described as a grouping or package of event objects. An event stream may be described as a flow of event block objects. A continuous query of the one or more continuous queries 804 transforms a source event stream made up of streaming event block objects published into ESPE 800 into one or more output event streams using the one or more source windows 806 and the one or more derived windows 808. A continuous query can also be thought of as data flow modeling.

The one or more source windows 806 are at the top of the directed graph and have no windows feeding into them. Event streams are published into the one or more source windows 806, and from there, the event streams may be directed to the next set of connected windows as defined by the directed graph. The one or more derived windows 808 are all instantiated windows that are not source windows and that have other windows streaming events into them. The one or more derived windows 808 may perform computations or transformations on the incoming event streams. The one or more derived windows 808 transform event streams based on the window type (that is operators such as join, filter, compute, aggregate, copy, pattern match, procedural, union, etc.) and window settings. As event streams are published into ESPE 800, they are continuously queried, and the resulting sets of derived windows in these queries are continuously updated.

FIG. 9 illustrates a flow chart showing an example process including operations performed by an event stream processing engine, according to some embodiments of the present technology. As noted, the ESPE 800 (or an associated ESP application) defines how input event streams are transformed into meaningful output event streams. More specifically, the ESP application may define how input event streams from publishers (e.g., network devices providing sensed data) are transformed into meaningful output event streams consumed by subscribers (e.g., a data analytics project being executed by a machine or set of machines).

Within the application, a user may interact with one or more user interface windows presented to the user in a display under control of the ESPE independently or through a browser application in an order selectable by the user. For example, a user may execute an ESP application, which causes presentation of a first user interface window, which may include a plurality of menus and selectors such as drop-down menus, buttons, text boxes, hyperlinks, etc. associated with the ESP application as understood by a person of skill in the art. As further understood by a person of skill in the art, various operations may be performed in parallel, for example, using a plurality of threads.

At operation 900, an ESP application may define and start an ESPE, thereby instantiating an ESPE at a device, such as machine 220 and/or 240. In an operation 902, the engine container is created. For illustration, ESPE 800 may be instantiated using a function call that specifies the engine container as a manager for the model.

In an operation 904, the one or more continuous queries 804 are instantiated by ESPE 800 as a model. The one or more continuous queries 804 may be instantiated with a dedicated thread pool or pools that generate updates as new events stream through ESPE 800. For illustration, the one or more continuous queries 804 may be created to model business processing logic within ESPE 800, to predict events within ESPE 800, to model a physical system within ESPE 800, to predict the physical system state within ESPE 800, etc. For example, as noted, ESPE 800 may be used to support sensor data monitoring and management (e.g., sensing may include force, torque, load, strain, position, temperature, air pressure, fluid flow, chemical properties, resistance, electromagnetic fields, radiation, irradiance, proximity, acoustics, moisture, distance, speed, vibrations, acceleration, electrical potential, or electrical current, etc.).

ESPE 800 may analyze and process events in motion or “event streams.” Instead of storing data and running queries against the stored data, ESPE 800 may store queries and stream data through them to allow continuous analysis of data as it is received. The one or more source windows 806 and the one or more derived windows 808 may be created based on the relational, pattern matching, and procedural algorithms that transform the input event streams into the output event streams to model, simulate, score, test, predict, etc. based on the continuous query model defined and application to the streamed data.

In an operation 906, a publish/subscribe (pub/sub) capability is initialized for ESPE 800. In an illustrative embodiment, a pub/sub capability is initialized for each project of the one or more projects 802. To initialize and enable pub/sub capability for ESPE 800, a port number may be provided. Pub/sub clients can use a host name of an ESP device running the ESPE and the port number to establish pub/sub connections to ESPE 800.

FIG. 10 illustrates an ESP system 1000 interfacing between publishing device 1022 and event subscribing devices 1024 a-c, according to embodiments of the present technology. ESP system 1000 may include ESP device or subsystem 851, event publishing device 1022, an event subscribing device A 1024 a, an event subscribing device B 1024 b, and an event subscribing device C 1024 c. Input event streams are output to ESP device 851 by publishing device 1022. In alternative embodiments, the input event streams may be created by a plurality of publishing devices. The plurality of publishing devices further may publish event streams to other ESP devices. The one or more continuous queries instantiated by ESPE 800 may analyze and process the input event streams to form output event streams output to event subscribing device A 1024 a, event subscribing device B 1024 b, and event subscribing device C 1024 c. ESP system 1000 may include a greater or a fewer number of event subscribing devices of event subscribing devices.

Publish-subscribe is a message-oriented interaction paradigm based on indirect addressing. Processed data recipients specify their interest in receiving information from ESPE 800 by subscribing to specific classes of events, while information sources publish events to ESPE 800 without directly addressing the receiving parties. ESPE 800 coordinates the interactions and processes the data. In some cases, the data source receives confirmation that the published information has been received by a data recipient.

A publish/subscribe API may be described as a library that enables an event publisher, such as publishing device 1022, to publish event streams into ESPE 800 or an event subscriber, such as event subscribing device A 1024 a, event subscribing device B 1024 b, and event subscribing device C 1024 c, to subscribe to event streams from ESPE 800. For illustration, one or more publish/subscribe APIs may be defined. Using the publish/subscribe API, an event publishing application may publish event streams into a running event stream processor project source window of ESPE 800, and the event subscription application may subscribe to an event stream processor project source window of ESPE 800.

The publish/subscribe API provides cross-platform connectivity and endianness compatibility between ESP application and other networked applications, such as event publishing applications instantiated at publishing device 1022, and event subscription applications instantiated at one or more of event subscribing device A 1024 a, event subscribing device B 1024 b, and event subscribing device C 1024 c.

Referring back to FIG. 9 , operation 906 initializes the publish/subscribe capability of ESPE 800. In an operation 908, the one or more projects 802 are started. The one or more started projects may run in the background on an ESP device. In an operation 910, an event block object is received from one or more computing device of the event publishing device 1022.

ESP subsystem 800 may include a publishing client 1002, ESPE 800, a subscribing client A 1004, a subscribing client B 1006, and a subscribing client C 1008. Publishing client 1002 may be started by an event publishing application executing at publishing device 1022 using the publish/subscribe API. Subscribing client A 1004 may be started by an event subscription application A, executing at event subscribing device A 1024 a using the publish/subscribe API. Subscribing client B 1006 may be started by an event subscription application B executing at event subscribing device B 1024 b using the publish/subscribe API. Subscribing client C 1008 may be started by an event subscription application C executing at event subscribing device C 1024 c using the publish/subscribe API.

An event block object containing one or more event objects is injected into a source window of the one or more source windows 806 from an instance of an event publishing application on event publishing device 1022. The event block object may be generated, for example, by the event publishing application and may be received by publishing client 1002. A unique ID may be maintained as the event block object is passed between the one or more source windows 806 and/or the one or more derived windows 808 of ESPE 800, and to subscribing client A 1004, subscribing client B 1006, and subscribing client C 1008 and to event subscription device A 1024 a, event subscription device B 1024 b, and event subscription device C 1024 c. Publishing client 1002 may further generate and include a unique embedded transaction ID in the event block object as the event block object is processed by a continuous query, as well as the unique ID that publishing device 1022 assigned to the event block object.

In an operation 912, the event block object is processed through the one or more continuous queries 804. In an operation 914, the processed event block object is output to one or more computing devices of the event subscribing devices 1024 a-c. For example, subscribing client A 1004, subscribing client B 1006, and subscribing client C 1008 may send the received event block object to event subscription device A 1024 a, event subscription device B 1024 b, and event subscription device C 1024 c, respectively.

ESPE 800 maintains the event block containership aspect of the received event blocks from when the event block is published into a source window and works its way through the directed graph defined by the one or more continuous queries 804 with the various event translations before being output to subscribers. Subscribers can correlate a group of subscribed events back to a group of published events by comparing the unique ID of the event block object that a publisher, such as publishing device 1022, attached to the event block object with the event block ID received by the subscriber.

In an operation 916, a determination is made concerning whether or not processing is stopped. If processing is not stopped, processing continues in operation 910 to continue receiving the one or more event streams containing event block objects from the, for example, one or more network devices. If processing is stopped, processing continues in an operation 918. In operation 918, the started projects are stopped. In operation 920, the ESPE is shutdown.

As noted, in some embodiments, big data is processed for an analytics project after the data is received and stored. In other embodiments, distributed applications process continuously flowing data in real-time from distributed sources by applying queries to the data before distributing the data to geographically distributed recipients. As noted, an event stream processing engine (ESPE) may continuously apply the queries to the data as it is received and determines which entities receive the processed data. This allows for large amounts of data being received and/or collected in a variety of environments to be processed and distributed in real time. For example, as shown with respect to FIG. 2 , data may be collected from network devices that may include devices within the internet of things, such as devices within a home automation network. However, such data may be collected from a variety of different resources in a variety of different environments. In any such situation, embodiments of the present technology allow for real-time processing of such data.

Aspects of the current disclosure provide technical solutions to technical problems, such as computing problems that arise when an ESP device fails which results in a complete service interruption and potentially significant data loss. The data loss can be catastrophic when the streamed data is supporting mission critical operations such as those in support of an ongoing manufacturing or drilling operation. An embodiment of an ESP system achieves a rapid and seamless failover of ESPE running at the plurality of ESP devices without service interruption or data loss, thus significantly improving the reliability of an operational system that relies on the live or real-time processing of the data streams. The event publishing systems, the event subscribing systems, and each ESPE not executing at a failed ESP device are not aware of or effected by the failed ESP device. The ESP system may include thousands of event publishing systems and event subscribing systems. The ESP system keeps the failover logic and awareness within the boundaries of out-messaging network connector and out-messaging network device.

In one example embodiment, a system is provided to support a failover when event stream processing (ESP) event blocks. The system includes, but is not limited to, an out-messaging network device and a computing device. The computing device includes, but is not limited to, a processor and a computer-readable medium operably coupled to the processor. The processor is configured to execute an ESP engine (ESPE). The computer-readable medium has instructions stored thereon that, when executed by the processor, cause the computing device to support the failover. An event block object is received from the ESPE that includes a unique identifier. A first status of the computing device as active or standby is determined. When the first status is active, a second status of the computing device as newly active or not newly active is determined. Newly active is determined when the computing device is switched from a standby status to an active status. When the second status is newly active, a last published event block object identifier that uniquely identifies a last published event block object is determined. A next event block object is selected from a non-transitory computer-readable medium accessible by the computing device. The next event block object has an event block object identifier that is greater than the determined last published event block object identifier. The selected next event block object is published to an out-messaging network device. When the second status of the computing device is not newly active, the received event block object is published to the out-messaging network device. When the first status of the computing device is standby, the received event block object is stored in the non-transitory computer-readable medium.

FIG. 11 is a flow chart of an example of a process for generating and using a machine-learning model according to some aspects. Machine learning is a branch of artificial intelligence that relates to mathematical models that can learn from, categorize, and make predictions about data. Such mathematical models, which can be referred to as machine-learning models, can classify input data among two or more classes; cluster input data among two or more groups; predict a result based on input data; identify patterns or trends in input data; identify a distribution of input data in a space; or any combination of these. Examples of machine-learning models can include (i) neural networks; (ii) decision trees, such as classification trees and regression trees; (iii) classifiers, such as Naïve bias classifiers, logistic regression classifiers, ridge regression classifiers, random forest classifiers, least absolute shrinkage and selector (LASSO) classifiers, and support vector machines; (iv) clusterers, such as k-means clusterers, mean-shift clusterers, and spectral clusterers; (v) factorizers, such as factorization machines, principal component analyzers and kernel principal component analyzers; and (vi) ensembles or other combinations of machine-learning models. In some examples, neural networks can include deep neural networks, feed-forward neural networks, recurrent neural networks, convolutional neural networks, radial basis function (RBF) neural networks, echo state neural networks, long short-term memory neural networks, bi-directional recurrent neural networks, gated neural networks, hierarchical recurrent neural networks, stochastic neural networks, modular neural networks, spiking neural networks, dynamic neural networks, cascading neural networks, neuro-fuzzy neural networks, or any combination of these.

Different machine-learning models may be used interchangeably to perform a task. Examples of tasks that can be performed at least partially using machine-learning models include various types of scoring; bioinformatics; cheminformatics; software engineering; fraud detection; customer segmentation; generating online recommendations; adaptive websites; determining customer lifetime value; search engines; placing advertisements in real time or near real time; classifying DNA sequences; affective computing; performing natural language processing and understanding; object recognition and computer vision; robotic locomotion; playing games; optimization and metaheuristics; detecting network intrusions; medical diagnosis and monitoring; or predicting when an asset, such as a machine, will need maintenance.

Any number and combination of tools can be used to create machine-learning models. Examples of tools for creating and managing machine-learning models can include SAS® Enterprise Miner, SAS® Rapid Predictive Modeler, and SAS® Model Manager, SAS Cloud Analytic Services (CAS)®, SAS Viya® of all which are by SAS Institute Inc. of Cary, North Carolina.

Machine-learning models can be constructed through an at least partially automated (e.g., with little or no human involvement) process called training. During training, input data can be iteratively supplied to a machine-learning model to enable the machine-learning model to identify patterns related to the input data or to identify relationships between the input data and output data. With training, the machine-learning model can be transformed from an untrained state to a trained state. Input data can be split into one or more training sets and one or more validation sets, and the training process may be repeated multiple times. The splitting may follow a k-fold cross-validation rule, a leave-one-out-rule, a leave-p-out rule, or a holdout rule. An overview of training and using a machine-learning model is described below with respect to the flow chart of FIG. 11 .

In block 1102, training data is received. In some examples, the training data is received from a remote database or a local database, constructed from various subsets of data, or input by a user. The training data can be used in its raw form for training a machine-learning model or pre-processed into another form, which can then be used for training the machine-learning model. For example, the raw form of the training data can be smoothed, truncated, aggregated, clustered, or otherwise manipulated into another form, which can then be used for training the machine-learning model.

In block 1104, a machine-learning model is trained using the training data. The machine-learning model can be trained in a supervised, unsupervised, or semi-supervised manner. In supervised training, each input in the training data is correlated to a desired output. This desired output may be a scalar, a vector, or a different type of data structure such as text or an image. This may enable the machine-learning model to learn a mapping between the inputs and desired outputs. In unsupervised training, the training data includes inputs, but not desired outputs, so that the machine-learning model has to find structure in the inputs on its own. In semi-supervised training, only some of the inputs in the training data are correlated to desired outputs.

In block 1106, the machine-learning model is evaluated. For example, an evaluation dataset can be obtained, for example, via user input or from a database. The evaluation dataset can include inputs correlated to desired outputs. The inputs can be provided to the machine-learning model and the outputs from the machine-learning model can be compared to the desired outputs. If the outputs from the machine-learning model closely correspond with the desired outputs, the machine-learning model may have a high degree of accuracy. For example, if 90% or more of the outputs from the machine-learning model are the same as the desired outputs in the evaluation dataset, the machine-learning model may have a high degree of accuracy. Otherwise, the machine-learning model may have a low degree of accuracy. The 90% number is an example only. A realistic and desirable accuracy percentage is dependent on the problem and the data.

In some examples, if, at 1108, the machine-learning model has an inadequate degree of accuracy for a particular task, the process can return to block 1104, where the machine-learning model can be further trained using additional training data or otherwise modified to improve accuracy. However, if, at 1108. the machine-learning model has an adequate degree of accuracy for the particular task, the process can continue to block 1110.

In block 1110, new data is received. In some examples, the new data is received from a remote database or a local database, constructed from various subsets of data, or input by a user. The new data may be unknown to the machine-learning model. For example, the machine-learning model may not have previously processed or analyzed the new data.

In block 1112, the trained machine-learning model is used to analyze the new data and provide a result. For example, the new data can be provided as input to the trained machine-learning model. The trained machine-learning model can analyze the new data and provide a result that includes a classification of the new data into a particular class, a clustering of the new data into a particular group, a prediction based on the new data, or any combination of these.

In block 1114, the result is post-processed. For example, the result can be added to, multiplied with, or otherwise combined with other data as part of a job. As another example, the result can be transformed from a first format, such as a time series format, into another format, such as a count series format. Any number and combination of operations can be performed on the result during post-processing.

A more specific example of a machine-learning model is the neural network 1200 shown in FIG. 12 . The neural network 1200 is represented as multiple layers of neurons 1208 that can exchange data between one another via connections 1255 that may be selectively instantiated thereamong. The layers include an input layer 1202 for receiving input data provided at inputs 1222, one or more hidden layers 1204, and an output layer 1206 for providing a result at outputs 1277. The hidden layer(s) 1204 are referred to as hidden because they may not be directly observable or have their inputs or outputs directly accessible during the normal functioning of the neural network 1200. Although the neural network 1200 is shown as having a specific number of layers and neurons for exemplary purposes, the neural network 1200 can have any number and combination of layers, and each layer can have any number and combination of neurons.

The neurons 1208 and connections 1255 thereamong may have numeric weights, which can be tuned during training of the neural network 1200. For example, training data can be provided to at least the inputs 1222 to the input layer 1202 of the neural network 1200, and the neural network 1200 can use the training data to tune one or more numeric weights of the neural network 1200. In some examples, the neural network 1200 can be trained using backpropagation. Backpropagation can include determining a gradient of a particular numeric weight based on a difference between an actual output of the neural network 1200 at the outputs 1277 and a desired output of the neural network 1200. Based on the gradient, one or more numeric weights of the neural network 1200 can be updated to reduce the difference therebetween, thereby increasing the accuracy of the neural network 1200. This process can be repeated multiple times to train the neural network 1200. For example, this process can be repeated hundreds or thousands of times to train the neural network 1200.

In some examples, the neural network 1200 is a feed-forward neural network. In a feed-forward neural network, the connections 1255 are instantiated and/or weighted so that every neuron 1208 only propagates an output value to a subsequent layer of the neural network 1200. For example, data may only move one direction (forward) from one neuron 1208 to the next neuron 1208 in a feed-forward neural network. Such a “forward” direction may be defined as proceeding from the input layer 1202 through the one or more hidden layers 1204, and toward the output layer 1206.

In other examples, the neural network 1200 may be a recurrent neural network. A recurrent neural network can include one or more feedback loops among the connections 1255, thereby allowing data to propagate in both forward and backward through the neural network 1200. Such a “backward” direction may be defined as proceeding in the opposite direction of forward, such as from the output layer 1206 through the one or more hidden layers 1204, and toward the input layer 1202. This can allow for information to persist within the recurrent neural network. For example, a recurrent neural network can determine an output based at least partially on information that the recurrent neural network has seen before, giving the recurrent neural network the ability to use previous input to inform the output.

In some examples, the neural network 1200 operates by receiving a vector of numbers from one layer; transforming the vector of numbers into a new vector of numbers using a matrix of numeric weights, a nonlinearity, or both; and providing the new vector of numbers to a subsequent layer (“subsequent” in the sense of moving “forward”) of the neural network 1200. Each subsequent layer of the neural network 1200 can repeat this process until the neural network 1200 outputs a final result at the outputs 1277 of the output layer 1206. For example, the neural network 1200 can receive a vector of numbers at the inputs 1222 of the input layer 1202. The neural network 1200 can multiply the vector of numbers by a matrix of numeric weights to determine a weighted vector. The matrix of numeric weights can be tuned during the training of the neural network 1200. The neural network 1200 can transform the weighted vector using a nonlinearity, such as a sigmoid tangent or the hyperbolic tangent. In some examples, the nonlinearity can include a rectified linear unit, which can be expressed using the equation y=max(x, 0) where y is the output and x is an input value from the weighted vector. The transformed output can be supplied to a subsequent layer (e.g., a hidden layer 1204) of the neural network 1200. The subsequent layer of the neural network 1200 can receive the transformed output, multiply the transformed output by a matrix of numeric weights and a nonlinearity, and provide the result to yet another layer of the neural network 1200 (e.g., another, subsequent, hidden layer 1204). This process continues until the neural network 1200 outputs a final result at the outputs 1277 of the output layer 1206.

As also depicted in FIG. 12 , the neural network 1200 may be implemented either through the execution of the instructions of one or more routines 1244 by central processing units (CPUs), or through the use of one or more neuromorphic devices 1250 that incorporate a set of memristors (or other similar components) that each function to implement one of the neurons 1208 in hardware. Where multiple neuromorphic devices 1250 are used, they may be interconnected in a depth-wise manner to enable implementing neural networks with greater quantities of layers, and/or in a width-wise manner to enable implementing neural networks having greater quantities of neurons 1208 per layer.

The neuromorphic device 1250 may incorporate a storage interface 1299 by which neural network configuration data 1293 that is descriptive of various parameters and hyper parameters of the neural network 1200 may be stored and/or retrieved. More specifically, the neural network configuration data 1293 may include such parameters as weighting and/or biasing values derived through the training of the neural network 1200, as has been described. Alternatively, or additionally, the neural network configuration data 1293 may include such hyperparameters as the manner in which the neurons 1208 are to be interconnected (e.g., feed-forward or recurrent), the trigger function to be implemented within the neurons 1208, the quantity of layers and/or the overall quantity of the neurons 1208. The neural network configuration data 1293 may provide such information for more than one neuromorphic device 1250 where multiple ones have been interconnected to support larger neural networks.

Other examples of the present disclosure may include any number and combination of machine-learning models having any number and combination of characteristics. The machine-learning model(s) can be trained in a supervised, semi-supervised, or unsupervised manner, or any combination of these. The machine-learning model(s) can be implemented using a single computing device or multiple computing devices, such as the communications grid computing system 400 discussed above.

Implementing some examples of the present disclosure at least in part by using machine-learning models can reduce the total number of processing iterations, time, memory, electrical power, or any combination of these consumed by a computing device when analyzing data. For example, a neural network may more readily identify patterns in data than other approaches. This may enable the neural network to analyze the data using fewer processing cycles and less memory than other approaches, while obtaining a similar or greater level of accuracy.

Some machine-learning approaches may be more efficiently and speedily executed and processed with machine-learning specific processors (e.g., not a generic CPU). Such processors may also provide an energy savings when compared to generic CPUs. For example, some of these processors can include a graphical processing unit (GPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), an artificial intelligence (AI) accelerator, a neural computing core, a neural computing engine, a neural processing unit, a purpose-built chip architecture for deep learning, and/or some other machine-learning specific processor that implements a machine learning approach or one or more neural networks using semiconductor (e.g., silicon (Si), gallium arsenide(GaAs)) devices. These processors may also be employed in heterogeneous computing architectures with a number of and/or a variety of different types of cores, engines, nodes, and/or layers to achieve various energy efficiencies, processing speed improvements, data communication speed improvements, and/or data efficiency targets and improvements throughout various parts of the system when compared to a homogeneous computing architecture that employs CPUs for general purpose computing.

FIG. 13 illustrates various aspects of the use of containers 1336 as a mechanism to allocate processing, storage and/or other resources of a processing system 1300 to the performance of various analyses. More specifically, in a processing system 1300 that includes one or more node devices 1330 (e.g., the aforedescribed grid system 400), the processing, storage and/or other resources of each node device 1330 may be allocated through the instantiation and/or maintenance of multiple containers 1336 within the node devices 1330 to support the performance(s) of one or more analyses. As each container 1336 is instantiated, predetermined amounts of processing, storage and/or other resources may be allocated thereto as part of creating an execution environment therein in which one or more executable routines 1334 may be executed to cause the performance of part or all of each analysis that is requested to be performed.

It may be that at least a subset of the containers 1336 are each allocated a similar combination and amounts of resources so that each is of a similar configuration with a similar range of capabilities, and therefore, are interchangeable. This may be done in embodiments in which it is desired to have at least such a subset of the containers 1336 already instantiated prior to the receipt of requests to perform analyses, and thus, prior to the specific resource requirements of each of those analyses being known.

Alternatively, or additionally, it may be that at least a subset of the containers 1336 are not instantiated until after the processing system 1300 receives requests to perform analyses where each request may include indications of the resources required for one of those analyses. Such information concerning resource requirements may then be used to guide the selection of resources and/or the amount of each resource allocated to each such container 1336. As a result, it may be that one or more of the containers 1336 are caused to have somewhat specialized configurations such that there may be differing types of containers to support the performance of different analyses and/or different portions of analyses.

It may be that the entirety of the logic of a requested analysis is implemented within a single executable routine 1334. In such embodiments, it may be that the entirety of that analysis is performed within a single container 1336 as that single executable routine 1334 is executed therein. However, it may be that such a single executable routine 1334, when executed, is at least intended to cause the instantiation of multiple instances of itself that are intended to be executed at least partially in parallel. This may result in the execution of multiple instances of such an executable routine 1334 within a single container 1336 and/or across multiple containers 1336.

Alternatively, or additionally, it may be that the logic of a requested analysis is implemented with multiple differing executable routines 1334. In such embodiments, it may be that at least a subset of such differing executable routines 1334 are executed within a single container 1336. However, it may be that the execution of at least a subset of such differing executable routines 1334 is distributed across multiple containers 1336.

Where an executable routine 1334 of an analysis is under development, and/or is under scrutiny to confirm its functionality, it may be that the container 1336 within which that executable routine 1334 is to be executed is additionally configured assist in limiting and/or monitoring aspects of the functionality of that executable routine 1334. More specifically, the execution environment provided by such a container 1336 may be configured to enforce limitations on accesses that are allowed to be made to memory and/or I/O addresses to control what storage locations and/or I/O devices may be accessible to that executable routine 1334. Such limitations may be derived based on comments within the programming code of the executable routine 1334 and/or other information that describes what functionality the executable routine 1334 is expected to have, including what memory and/or I/O accesses are expected to be made when the executable routine 1334 is executed. Then, when the executable routine 1334 is executed within such a container 1336, the accesses that are attempted to be made by the executable routine 1334 may be monitored to identify any behavior that deviates from what is expected.

Where the possibility exists that different executable routines 1334 may be written in different programming languages, it may be that different subsets of containers 1336 are configured to support different programming languages. In such embodiments, it may be that each executable routine 1334 is analyzed to identify what programming language it is written in, and then what container 1336 is assigned to support the execution of that executable routine 1334 may be at least partially based on the identified programming language. Where the possibility exists that a single requested analysis may be based on the execution of multiple executable routines 1334 that may each be written in a different programming language, it may be that at least a subset of the containers 1336 are configured to support the performance of various data structure and/or data format conversion operations to enable a data object output by one executable routine 1334 written in one programming language to be accepted as an input to another executable routine 1334 written in another programming language.

As depicted, at least a subset of the containers 1336 may be instantiated within one or more VMs 1331 that may be instantiated within one or more node devices 1330. Thus, in some embodiments, it may be that the processing, storage and/or other resources of at least one node device 1330 may be partially allocated through the instantiation of one or more VMs 1331, and then in turn, may be further allocated within at least one VM 1331 through the instantiation of one or more containers 1336.

In some embodiments, it may be that such a nested allocation of resources may be carried out to effect an allocation of resources based on two differing criteria. By way of example, it may be that the instantiation of VMs 1331 is used to allocate the resources of a node device 1330 to multiple users or groups of users in accordance with any of a variety of service agreements by which amounts of processing, storage and/or other resources are paid for each such user or group of users. Then, within each VM 1331 or set of VMs 1331 that is allocated to a particular user or group of users, containers 1336 may be allocated to distribute the resources allocated to each VM 1331 among various analyses that are requested to be performed by that particular user or group of users.

As depicted, where the processing system 1300 includes more than one node device 1330, the processing system 1300 may also include at least one control device 1350 within which one or more control routines 1354 may be executed to control various aspects of the use of the node device(s) 1330 to perform requested analyses. By way of example, it may be that at least one control routine 1354 implements logic to control the allocation of the processing, storage and/or other resources of each node device 1300 to each VM 1331 and/or container 1336 that is instantiated therein. Thus, it may be the control device(s) 1350 that effects a nested allocation of resources, such as the aforedescribed example allocation of resources based on two differing criteria.

As also depicted, the processing system 1300 may also include one or more distinct requesting devices 1370 from which requests to perform analyses may be received by the control device(s) 1350. Thus, and by way of example, it may be that at least one control routine 1354 implements logic to monitor for the receipt of requests from authorized users and/or groups of users for various analyses to be performed using the processing, storage and/or other resources of the node device(s) 1330 of the processing system 1300. The control device(s) 1350 may receive indications of the availability of resources, the status of the performances of analyses that are already underway, and/or still other status information from the node device(s) 1330 in response to polling, at a recurring interval of time, and/or in response to the occurrence of various preselected events. More specifically, the control device(s) 1350 may receive indications of status for each container 1336, each VM 1331 and/or each node device 1330. At least one control routine 1354 may implement logic that may use such information to select container(s) 1336, VM(s) 1331 and/or node device(s) 1330 that are to be used in the execution of the executable routine(s) 1334 associated with each requested analysis.

As further depicted, in some embodiments, the one or more control routines 1354 may be executed within one or more containers 1356 and/or within one or more VMs 1351 that may be instantiated within the one or more control devices 1350. It may be that multiple instances of one or more varieties of control routine 1354 may be executed within separate containers 1356, within separate VMs 1351 and/or within separate control devices 1350 to better enable parallelized control over parallel performances of requested analyses, to provide improved redundancy against failures for such control functions, and/or to separate differing ones of the control routines 1354 that perform different functions. By way of example, it may be that multiple instances of a first variety of control routine 1354 that communicate with the requesting device(s) 1370 are executed in a first set of containers 1356 instantiated within a first VM 1351, while multiple instances of a second variety of control routine 1354 that control the allocation of resources of the node device(s) 1330 are executed in a second set of containers 1356 instantiated within a second VM 1351. It may be that the control of the allocation of resources for performing requested analyses may include deriving an order of performance of portions of each requested analysis based on such factors as data dependencies thereamong, as well as allocating the use of containers 1336 in a manner that effectuates such a derived order of performance.

Where multiple instances of control routine 1354 are used to control the allocation of resources for performing requested analyses, such as the assignment of individual ones of the containers 1336 to be used in executing executable routines 1334 of each of multiple requested analyses, it may be that each requested analysis is assigned to be controlled by just one of the instances of control routine 1354. This may be done as part of treating each requested analysis as one or more “ACID transactions” that each have the four properties of atomicity, consistency, isolation and durability such that a single instance of control routine 1354 is given full control over the entirety of each such transaction to better ensure that either all of each such transaction is either entirely performed or is entirely not performed. As will be familiar to those skilled in the art, allowing partial performances to occur may cause cache incoherencies and/or data corruption issues.

As additionally depicted, the control device(s) 1350 may communicate with the requesting device(s) 1370 and with the node device(s) 1330 through portions of a network 1399 extending thereamong. Again, such a network as the depicted network 1399 may be based on any of a variety of wired and/or wireless technologies and may employ any of a variety of protocols by which commands, status, data and/or still other varieties of information may be exchanged. It may be that one or more instances of a control routine 1354 cause the instantiation and maintenance of a web portal or other variety of portal that is based on any of a variety of communication protocols, etc. (e.g., a restful API). Through such a portal, requests for the performance of various analyses may be received from requesting device(s) 1370, and/or the results of such requested analyses may be provided thereto. Alternatively, or additionally, it may be that one or more instances of a control routine 1354 cause the instantiation of and maintenance of a message passing interface and/or message queues. Through such an interface and/or queues, individual containers 1336 may each be assigned to execute at least one executable routine 1334 associated with a requested analysis to cause the performance of at least a portion of that analysis.

Although not specifically depicted, it may be that at least one control routine 1354 may include logic to implement a form of management of the containers 1336 based on the Kubernetes container management platform promulgated by Could Native Computing Foundation of San Francisco, CA, USA. In such embodiments, containers 1336 in which executable routines 1334 of requested analyses may be instantiated within “pods” (not specifically shown) in which other containers may also be instantiated for the execution of other supporting routines. Such supporting routines may cooperate with control routine(s) 1354 to implement a communications protocol with the control device(s) 1350 via the network 1399 (e.g., a message passing interface, one or more message queues, etc.). Alternatively, or additionally, such supporting routines may serve to provide access to one or more storage repositories (not specifically shown) in which at least data objects may be stored for use in performing the requested analyses.

FIGS. 14A, 14B, 14C, 14D, 14E and 14F, together, illustrate two different example embodiments of a processing system 2000 and framework for the performance of multiple operations to convert speech to text and/or to derive insights from such text. Each of these two processing systems 2000 incorporates one or more storage devices 2100 that may form a storage grid 2001, one or more node devices 2300 that may form of a node device grid 2003, at least one control device 2500 and/or at least one requesting device 2700, all coupled by a network 2999. However, aspects of the manner in which the devices 2100, 2300, 2500 and/or 2700 are used to perform these operations differ between these two embodiments. More specifically, FIGS. 14A-C are block diagrams of various aspects of an example embodiment of a distributed processing system 2000 in which, for each speech data set 3100 and/or for each text data set 3700, the parallel processing of one or more operations is effected through the use of multiple processors 2350 and/or cores 2351 of processors 2350 across multiple node devices 2300. FIGS. 14D-F are block diagrams of various aspects of an alternate example of a distributed processing system 2000 in which, for each speech data set 3100 and/or each text data set 3700, parallel processing of various operations is effected through the use of multiple threads 2454 across one or more processors 2350 and/or cores 2351 of processor(s) 2350 within a single one of the node devices 2300.

For both embodiments of the distributed processing system 2000 of FIGS. 14A-C and of FIGS. 14D-F, the storage device(s) 2100 may store one or more speech data sets 3100 in which speech audio may be stored in any of a variety of digital audio storage formats. Where there are multiple storage devices 2100, at least a subset of the one or more speech data sets 3100 may be stored in a distributed manner in which different portions thereof are stored within different ones of the storage devices 2100. As will be explained in greater detail, in support of the performance of pre-processing operations, of speech-to-text processing operations and/or of text analytics post-processing operations, a speech data set 3100 may be divided into data chunks 3110 that each represent a chunk of the speech audio of the speech data set 3100, and/or may be divided into data segments 3140 that each represent a speech segment of that speech audio. Those data chunks 3110 and/or those data segments 3140 may then be provided to either a single node device 2300 or multiple ones of the node devices 2300, depending on which of the distributed processing systems 2000 of FIGS. 14A-C or 14D-F is implemented.

The storage device(s) 2100 may also store one or more corpus data sets 3400 that each represent a language model implemented as a corpus of a particular language, and/or one or more text data sets 3700 that each represent a transcript of speech audio that may each have been originally stored as a speech data set 3100. As with the one or more speech data sets 3100, where there are multiple storage devices 2100, at least a subset of the one or more corpus data sets 3400, and/or at least a subset of the one or more text data sets 3700, may be stored in a distributed manner in which different portions thereof are stored within different ones of the storage devices 2100. In support of distributed speech-to-text processing operations, and/or in support of distributed text analytics post-processing operations, multiple copies of the entirety of a corpus data set 3400 may be provided to either multiple node devices 2300 of the distributed processing system of FIGS. 14A-C, or multiple threads 2454 of a single one of the node devices 2300 of the distributed processing system of FIGS. 14D-F.

Thus, in support of such operations, the devices 2100, 2300, 2500 and/or 2700 may exchange such portions of a speech data set 3100, may exchange copies of a corpus data set 3400, and/or may exchange other information concerning speech audio pre-processing operations, speech-to-text conversion and/or text analyses through the network 2999. In various embodiments, the network 2999 may be a single network that may extend within a single building or other relatively limited area, a combination of connected networks that may extend a considerable distance, and/or may include the Internet. Thus, the network 2999 may be based on any of a variety (or combination) of communications technologies by which communications may be effected, including without limitation, wired technologies employing electrically and/or optically conductive cabling, and wireless technologies employing infrared, radio frequency (RF) or other forms of wireless transmission.

Each of the speech data sets 3100 may be any of a variety of types of digital data representation of any of a variety of types of speech audio. Such representations of speech audio may include a series of amplitude values of one or more audio channels of any of a variety of bit widths (e.g., 8-bit, 12-bit, 16-bit, 20-bit or 24-bit), captured at any of a variety of sampling rates (e.g., 41.1 kHz, 48 kHz, 88.2 kHz or 96 kHz), and stored in any of a variety of widely used compressed or uncompressed audio data formats (e.g., MP3 (Motion Picture Experts Group layer 3), WAV (Waveform Audio), PCM (Pulse-Code Modulation), FLAC (Free Lossless Audio Codec)), Dolby Digital or TrueHD of Dolby Laboratories of San Francisco, California, USA, or THX Ultra2 or Select2 of THX Ltd. of San Francisco, California, USA). In some embodiments, the speech data set 3100 may include other data beyond speech audio, such as corresponding video, corresponding still images (e.g., a corresponding slide show of still images), alternate corresponding speech audio in a different language, etc. In some of such embodiments, the speech data set 3100 may be any of a variety of types of “container” format or other data format that supports the provision of a multimedia or other combined audio and video presentation (e.g., MP4 of the International Organization for Standardization of Geneva, Switzerland).

The speech audio that is so represented within each speech data set 3100 may include any of a variety of types of speech made up of words that spoken by one or more speakers, including and not limited to, telephone and/or radio conversations (e.g., telephone service calls, or air traffic control communications), telephone messages or other forms of voice mail, audio from in-person and/or remote conferences, lecture speech, podcasts, audio tracks from entertainment programs that include speech audio (e.g., audio from movies or from musical performances), verbal narrations of stories and/or of events in progress (e.g., narrations of sports events or other news events), and/or verbal commands to local electronic devices and/or to servers providing online services, etc.

To be clear, the term “speaker” as used herein to refer to source(s) of the speech audio that is represented by the speech data set(s) 3100 is envisioned as referring to talking people (human beings). As will be explained in greater detail, various characteristics of the speech sounds produced by the vocal tracts of each such person (along with the language(s) they speak and/or the accent(s) they speak with) may be relied upon in identifying sentence pauses and/or in identifying individual speakers. However, it should be noted that, in some embodiments, one or more speakers of speech audio represented by a speech data set 3100 may be a machine-based speaker (e.g., a computer or other electronic device employing speech-to-text synthesizer components to generate synthesized speech sounds). Alternatively, or additionally, it may be that one or more speakers of speech audio represented by a speech data set 3100 may be a non-human animal that may have learned to generate human speech sounds (e.g., a parrot or a great ape).

At least a subset of the speech data sets 3100 stored by the one or more storage devices 2100 may each represent a stored recording of speech audio that was fully captured at an earlier time. Thus, such speech data set(s) 3100 may represent speech audio that may have been recorded either relatively recently (e.g., within recent minutes or hours), or long ago (e.g., weeks, months or years earlier). Alternatively, or additionally, at least another subset of the speech data sets 3100 may each represent just a stored portion of speech audio that is still in the process of being captured. Thus, such speech data set(s) 3100 may serve, at least temporarily, as buffer(s) of portions of ongoing speech audio that have already been captured, with more portions thereof still in the process of being captured.

It is envisioned that at least a subset of the speech data sets 3100 may be sufficiently large in size such that storage and/or processing of the entirety thereof within a single device may be deemed to be at least impractical, if not impossible. Therefore, to facilitate storage and/or processing of such larger speech data sets 3100 in a distributed manner across multiple devices, each of such larger speech data sets 3100 may be divided into multiple portions that may be distributed among multiple storage devices 2100 and/or among multiple node devices 2300.

In some embodiments, multiple ones of the storage devices 2100 may be operated together (e.g., as a network-attached drive array, etc.) primarily for the purpose of persistently storing data, such as the one or more speech data sets 3100. In such embodiments, the multiple storage devices 2100 may be capable of exchanging the entirety of a relatively large speech data set 3100 with multiple node devices 2300 in a set of data transfers of portions thereof (e.g., data chunks 3110 thereof, or data segments 3140 thereof) performed at least partially in parallel through the network 2999, and such transfers may be coordinated by the control device 2500. In some embodiments, processor(s) of the one or more storage devices 2100 may each independently implement a local file system by which at least relatively small speech data sets 3100 may each be stored entirely within a single one of the storage devices 2100. Alternatively, or additionally, multiple ones of the storage devices 2100 may cooperate through the network 2999 to implement a distributed file system to store larger speech data sets 3100 as multiple portions in a distributed manner across multiple ones of the storage devices 2100. As still another alternative, it may be that one or more of the storage devices 2100 store a combination of whole speech data sets 3100 that are of relatively small data size such that they are able to be stored entirely within a single storage device 2100, and a portion of at least one speech data set 3100 that is too large in data size to be able to be stored entirely within any single one of the storage devices 2100.

Referring more specifically to FIGS. 14A-C, and the embodiment of distributed processing system 2000 depicted therein, each of the multiple node devices 2300 may incorporate one or more processors 2350, one or more neuromorphic devices 2355, a storage 2360, and/or a network interface 2390 to couple each of the node devices 2300 to the network 2999. The processor(s) 2350 may incorporate multiple processing cores 2351 and/or other features to support the execution of multiple executable routines and/or multiple instances of executable routine(s) across multiple execution threads. The storage 2360 may store control routines 2310, 2340 and/or 2370; one or more data chunks 3110; one or more data segments 3140; and/or a corpus data set 3400.

Each of the control routines 2310, 2340 and 2370 may incorporate a sequence of instructions operative on the processor(s) 2350 to implement logic to perform various functions. In executing the control routine 2310, the processor(s) 2350 of each of the node devices 2300 may be caused to perform various pre-processing operations, such as normalization of the digital audio storage format in which the chunk of speech audio within each data chunk 3110 is stored, speaker diarization to identify which speaker(s) spoke which portions of the speech audio of the speech data set 3100, and/or determining the manner in which a speech data set 3100 is to be divided into data segments 3140 thereof as input to speech-to-text processing operations. In executing the control routine 2340, the processor(s) 2350 of each of the node devices 2300 may be caused to perform various speech-to-text processing operations, such as feature detection to identify acoustic features within the speech segment of each data segment 3140, using multiple instances of an acoustic model to identify likely graphemes, and/or use multiple instances of an n-gram language model (stored as a corpus data set 3400) to assist in identifying likely words to generate a transcript of the speech audio of the speech data set 3100, which may then be stored within the one or more storage devices 2100 as a corresponding text data set 3700. In executing the control routine 2370, the processor(s) 2350 of each of the node devices 2300 may be caused to perform various post-processing operations, such as text analytics to derive various insights concerning the contents of speech audio stored as a speech data set 3100, and/or the generation of various visualizations for presenting such insights. Where such visualizations are generated by the node devices 2300 (and/or by the control device 2500), such visualizations may be stored as part of (or in a manner that accompanies) the text metadata 3779. However, where such visualizations are to be subsequently generated by the requesting device 2700, such generation of such visualizations may be based on the text metadata 3779.

In performing, at least, a subset of pre-processing operations, at least a subset of text-to-speech processing operations and/or at least a subset of post-processing operations, the processor(s) 2350 of multiple ones of the node devices 2300 may be caused to perform such operations at least partially in parallel for a single speech data set 3100 and/or a single text data set 3700. As has been explained, this may be at least partially due to the size of speech data set 3100. Alternatively, or additionally, this may be at least partially due to a need or desire to increase the speed and/or efficiency with which one or more of such operations are performed, regardless of the size of a speech data set 3100. Regardless of the motivation, such at least partially parallel performances of such operations may be coordinated by the control device 2500 through the network 2999.

As will also be explained in greater detail, at least a subset of the pre-processing operations, text-to-speech processing operations and/or post-processing operations may employ neural network(s). In embodiments of the node device(s) 2300 that incorporate the neuromorphic device(s) 2355, the neuromorphic device(s) 2355 may be employed to implement one or more of such neural networks in hardware, and the processor(s) 2350 may be caused by one or more of the control routine(s) 2310, 2340 and/or 2370 to configure the neuromorphic device(s) 2355 to do so. However, in embodiments of the node device(s) 2300 that do not incorporate the neuromorphic device(s) 2355, the processor(s) 2350 may, as an alternative, be caused to execute routine(s) to implement such neural networks in software.

The control device 2500 may incorporate one or more processors 2550, a storage 2560, and/or a network interface 2590 to couple the control device 2500 to the network 2999. The processor(s) 2550 may incorporate multiple processing cores 2551 and/or other features to support the execution of multiple executable routines and/or multiple instances of executable routine(s) across multiple execution threads. The storage 2560 may store control routines 2510, 2540 and/or 2570, a resource routine 2640, configuration data 2335, a text data set 3700 and/or text metadata 3779.

Each of the control routines 2510, 2540 and 2570, and/or the resource routine 2640 may incorporate a sequence of instructions operative on the processor(s) 2550 to implement logic to perform various functions. In executing the resource routine 2640, processor(s) 2550 of the control device 2500 may be caused to operate the network interface 2590 to monitor the availability of processing, storage and/or other resources of each of the node devices 2300. The processor(s) 2550 of the control device 2500 may then use such information to determine what combination of node devices 2300 is to be employed in performing pre-processing operations and/or speech-to-text processing operations with each speech data set 3100, and/or what combination of node devices 2300 is to be employed in performing post-processing operations with each text data set 3700.

In executing the control routine 2510, it may be that processor(s) 2550 of the control device 2500 are caused to operate the network interface 2590 to coordinate, via the network 2999, at least a subset of the pre-processing operations performed, at least partially in parallel, by processors 2350 of multiple ones of the node devices 2300 for each speech data set 3100 as a result of executing corresponding instances of the control routine 2310. More specifically, the processor(s) 2550 may be caused to coordinate the performances of multiple pause detection techniques and/or speaker diarization techniques across multiple ones of the node devices 2300. Alternatively or additionally, as pause sets of indications of likely sentence pauses are derived from the performance of each pause detection technique, and/or as changes sets of indications of likely speaker changes are derived from the performance of at least one speaker diarization technique, it may be that processor(s) 2550 of the control device 2500 are caused by the control routine 2510 to use the pause sets and/or change sets received from node devices 2300 to derive a segmentation set 3119 of indications of the manner in which the speech audio of a speech data set 3100 is to be divided into segments.

In executing the control routine 2540, it may be that processor(s) 2550 of the control device 2500 are caused to operate the network interface 2590 to coordinate, via the network 2999, at least a subset of the speech-to-text processing operations performed, at least partially in parallel, by processors 2350 of multiple ones of the node devices 2300 for each speech data set 3100 as a result of executing corresponding instances of the control routine 2340. More specifically, the processor(s) 2550 may be caused to coordinate the generation of data segments 3140 (or of sets of data segments 3140) among the node devices 2300 based on the indications of likely sentence pauses within the segmentation set 3119 derived earlier during pre-processing. Alternatively, or additionally, the processor(s) 2550 may be caused to coordinate the detection of acoustic features within the speech segment of each of the data segments 3140, and/or to coordinate the use of multiple instances of an acoustic model to identify likely graphemes across multiple ones of the node devices 2300. Alternatively or additionally, as sets of probability distributions of likely graphemes are derived from such use of acoustic models, it may be that the processor(s) 2550 of the control device 2500 are caused by the control routine 2540 to use the sets of probability distributions received from multiple node devices 2300 as inputs to coordinate beam searches of multiple instances of an n-gram language model across multiple node devices 2300 (at least partially in parallel) to generate the transcript of the speech audio of the speech data set 3100.

More specifically and turning momentarily to a highly simplified example presented in FIG. 14C, where the storage device(s) 2100 store at least a speech data set 3100 x and another speech data set 3100 y, it may be that the processor(s) 2550 of the control device 2500 are caused by execution of the resource routine 2640 to monitor the availability of processing, storage and/or other resources of each of the node devices 2300. As will be familiar to those skilled in the art, each of the node devices 2300 may recurringly provide indications of such status to the control device 2500 via the network 2999. The processor(s) 2550 of the control device 2500 may use such information to identify a combination of node devices 2300 (labeled as 2300 x 1 and 2300 x 2 in FIG. 14C) as having sufficient available resources as to be available for use in performing pre-processing and/or speech-to-text processing operations to generate a text data set 3700 from the speech data set 3100 x, and may assign those node devices 2300 to do so. Similarly, the processor(s) 2550 of the control device 2500 may use such information to identify another combination of node devices 2300 (labeled as 2300 y 1 and 2300 y 2 in FIG. 14C) as having sufficient available resources as to be available for use in performing pre-processing and/or speech-to-text processing operations to generate another text data set 3700 from the speech data set 3100 y, and may assign those node devices to do so. It should be noted that, although the set of node devices 2300 x 1 and 2300 x 2 assigned to the speech data set 3100 x, and the set of node devices 2300 y 1 and 2300 y 2 assigned to the speech data set 3100 y, are depicted as not including any node devices 2300 that belong to both sets, it is entirely possible that there may be one or more node devices 2300 that are identified as having sufficient available resources as to allow their inclusion within more than one of such sets of node devices 2300.

As will be familiar to those skilled in the art, of the various pre-processing and processing operations that may be performed as part of converting speech to text, beam searches through a corpus that implements a language model have often been found to consume the greatest quantities of processing and/or storage resources, such that the performance of beam searches are often found to be a persistent bottleneck in performances of speech-to-text conversion. In view of this, as also depicted in FIG. 14C, and as will be explained in greater detail, it is envisioned that it may be performances of beam searches through a corpus data set 3400 that may be the one type of speech-to-text operation that would be most useful to arrange to be performed in parallel across multiple node devices 2300. In view of this, and as depicted, it may be that multiple instances of at least a beam search component 2347 of the control routine 2340 may be executed at least partially in parallel by multiple processors 2350 across multiple node devices 2300 for both the speech data set 3100 x and the speech data set 3100 y.

Returning to FIGS. 14A-C, in executing the control routine 2570, the processor(s) 2550 of the control device 2500 may be caused to operate the network interface 2590 to coordinate, via the network 2999, at least a subset of post-processing operations performed, at least partially in parallel, by processors 2350 of multiple ones of the node device 2300 for each text data set 3700 as a result of executing corresponding instances of the control routine 2370. More specifically, the processors 2550 may be caused to coordinate the distributed use of various forms of text analytics among the node devices 2300 to derive insights concerning the speech audio of the speech data set 3100.

Referring more specifically to FIGS. 14D-F, and the embodiment of distributed processing system 2000 depicted therein, each of the multiple node devices 2300 may incorporate one or more processors 2350, one or more neuromorphic devices 2355, a storage 2360, and/or a network interface 2390 to couple each of the node devices 2300 to the network 2999. The processor(s) 2350 may incorporate multiple processing cores 2351 and/or other features to support the execution of multiple executable routines and/or multiple instances of executable routine(s) across multiple threads 2454. The storage 2360 may store control routines 2310, 2340 and/or 2370; a resource routine 2440; one or more data chunks 3110; one or more data segments 3140; a corpus data set 3400; a text data set 3700 and/or text metadata 3779.

Each of the control routines 2310, 2340 and 2370, and/or the resource routine 2440 may incorporate a sequence of instructions operative on the processor(s) 2350 to implement logic to perform various functions. In executing the resource routine 2440, processor(s) 2350 of a node device 2300 may be caused to monitor the availability of processing resources (including threads 2454), storage resources and/or other resources within that node device 2300. The processor(s) 2350 may then use such information to determine what quantity of threads 2454 is to be employed in performing pre-processing operations and/or speech-to-text processing operations with each speech data set 3100, and/or what quantity of threads 2454 is to be employed in performing post-processing operations with each text data set 3700.

In executing the control routine 2310, the processor(s) 2350 of a node devices 2300 may be caused to perform various pre-processing operations using one or more threads 2454, such as normalization of the digital audio storage format in which the chunk of speech audio within each data chunk 3110 is stored, speaker diarization to identify which speaker(s) spoke which portions of the speech audio of the speech data set 3100, and/or determining the manner in which a speech data set 3100 is to be divided into data segments 3140 thereof as input to speech-to-text processing operations. In executing the control routine 2340, the processor(s) 2350 of a node device 2300 may be caused to perform various speech-to-text processing operations using one or more threads 2454, such as feature detection to identify acoustic features within the speech segment of each data segment 3140, using multiple instances of an acoustic model to identify likely graphemes, and/or use multiple instances of an n-gram language model (stored as a corpus data set 3400) to assist in identifying likely words to generate a transcript of the speech audio of the speech data set 3100, which may then be stored within the one or more storage devices 2100 as a corresponding text data set 3700. In executing the control routine 2370, the processor(s) 2350 of a node device 2300 may be caused to perform various post-processing operations using one or more threads 2454, such as text analytics to derive various insights concerning the contents of speech audio stored as a speech data set 3100, and/or the generation of various visualizations for presenting such insights. Where such visualizations are generated by the node device 2300, such visualizations may be stored as part of (or in a manner that accompanies) the text metadata 3779. However, where such visualizations are to be subsequently generated by the requesting device 2700, such generation of such visualizations may be based on the text metadata 3779.

In performing at least a subset of pre-processing operations, at least a subset of text-to-speech processing operations and/or at least a subset of post-processing operations, the processor(s) 2350 of a node devices 2300 may be caused to perform such operations at least partially in parallel across multiple threads 2454 for a single speech data set 3100 and/or a single text data set 3700. As will be explained in greater detail, this may be at least partially due to experimental observations that the performance of particular operations, such as beam searches in speech-to-text processing operations, tend to become bottlenecks, while other operations are able to be performed significantly more quickly.

Again, as will also be explained in greater detail, at least a subset of the pre-processing operations, text-to-speech processing operations and/or post-processing operations may employ neural network(s). In embodiments of the node device(s) 2300 that incorporate the neuromorphic device(s) 2355, the neuromorphic device(s) 2355 may be employed to implement one or more of such neural networks in hardware, and the processor(s) 2350 may be caused by one or more of the control routine(s) 2310, 2340 and/or 2370 to configure the neuromorphic device(s) 2355 to do so. However, in embodiments of the node device(s) 2300 that do not incorporate the neuromorphic device(s) 2355, the processor(s) 2350 may, as an alternative, be caused to execute routine(s) to implement such neural networks in software.

The control device 2500 may incorporate one or more processors 2550, a storage 2560, and/or a network interface 2590 to couple the control device 2500 to the network 2999. The processor(s) 2550 may incorporate multiple processing cores 2551 and/or other features to support the execution of multiple executable routines and/or multiple instances of executable routine(s) across multiple execution threads. The storage 2560 may store a resource routine 2640 and/or configuration data 2335.

The resource routine 2640 may incorporate a sequence of instructions operative on the processor(s) 2550 to implement logic to perform various functions. In executing the resource routine 2640, processor(s) 2550 of the control device 2500 may be caused to operate the network interface 2590 to monitor the availability of processing, storage and/or other resources of each of the node devices 2300. In so doing, the processor(s) 2550 of the control device 2500 and the processor(s) 2350 of each of the node devices 2300 may be caused by execution of the resource routine 2640 and of the resource routine 2440, respectively, to cooperate to provide the processor(s) 2550 with indications of whether there are sufficient processing resources available within each node device 2300 to support the allocation of an appropriate quantity of threads 2454 to the performance of pre-processing operations and/or speech-to-text processing operations with another speech data set 3100, and/or to support the allocation of an appropriate quantity of threads 2454 to the performance of post-processing operations with another text data set 3700. The processor(s) 2550 may then use such information to determine availability of node devices 2300 to perform pre-processing operations and/or speech-to-text processing operations with a speech data set 3100, and/or availability to perform post-processing operations with a text data set 3700. The processor(s) 2550 of the control device 2500 may also use such information to determine which single node device 2300 to assign to perform such pre-processing and/or processing operations with each speech data set 3100, and/or which single node device 2300 to assign to perform such post-processing operations with each text data set 3700.

More specifically, and turning momentarily to a highly simplified example presented in FIG. 14F, where the storage device(s) 2100 store at least three speech data sets 3100 x, 3100 y and 3100 z, it may be that the processor(s) 2550 of the control device 2500 are caused by execution of the resource routine 2640 to monitor the availability of processing resources (such as threads 2454), storage resources and/or other resources of each of the node devices 2300. As previously discussed, the processor(s) 2350 within each of the node devices 2300 may be caused by execution of the resource routine 2440 to recurringly provide indications of such status (perhaps as indications of available threads 2454) to the control device 2500 via the network 2999. The processor(s) 2550 of the control device 2500 may use such information to identify a node device 2300 (labeled as 2300 xy in FIG. 14F) as having sufficient available resources to support a sufficient quantity of threads 2454 as to be available for use in performing pre-processing and/or speech-to-text processing operations to generate a text data set 3700 from the speech data set 3100 x, and may assign that node device 2300 xy to do so. Similarly, the processor(s) 2550 of the control device 2500 may use such information to determine that the same node device 2300 xy is also available for use in performing pre-processing and/or speech-to-text processing operations to generate another text data set 3700 from the speech data set 3100 y, and may assign that node device 2300 xy to do so. Also, similarly, the processor(s) 2550 of the control device 2500 may use such information to determine that another node device 2300 (labeled as node device 2300 z in FIG. 14F) is available for use in performing pre-processing and/or speech-to-text processing operations to generate still another text data set 3700 from the speech data set 3100 z, and may assign that node device 2300 z to do so.

Again, of the various pre-processing and processing operations that may be performed as part of converting speech to text, beam searches through a corpus that implements a language model have often been found to consume the greatest quantities of processing and/or storage resources, such that the performance of beam searches are often found to be a persistent bottleneck in performances of speech-to-text conversion. In view of this, as also depicted in FIG. 14F, and as will be explained in greater detail, it is envisioned that it may be performances of beam searches through a corpus data set 3400 that may be the one type of speech-to-text operation that would be most useful to arrange to be performed in parallel across multiple threads 2454. In view of this, and as depicted, it may be that multiple thread pools 2450 x, 2450 y and 2450 z are formed, each made up of multiple threads 2454, to enable multiple instances of at least a beam search component 2347 of the control routine 2340 to be executed at least partially in parallel for each one of the speech data sets 3100 x, 3100 y and 3100 z, respectively. As depicted, the thread pools 2450 x and 2450 y are each formed entirely within the node device 2300 xy, and the thread pool 2450 z is formed entirely within the node device 2300 z.

Referring again to both embodiments of the distributed processing system 2000 of FIGS. 14A-C and 14D-F, the requesting device 2700 may incorporate one or more of a processor 2750, a storage 2760, an input device 2720, a display 2780, and a network interface 2790 to couple the requesting device 2700 to the network 2999. The storage 2760 may store a control routine 2740, a text data set 3700 and/or text metadata 3779.

The control routine 2740 may incorporate a sequence of instructions operative on the processor 2750 to implement logic to perform various functions. In executing the control routine 2740, the processor 2750 of the requesting device 2700 may be caused to operate the input device 2720 and/or the display 2780 to provide a user interface (UI) by which an operator of the requesting device 2700 may transmit a request to the control device 2500 to perform one or more operations that may include speech-to-text conversion of the speech audio represented by a specified one of the speech data sets 3100 and/or that include the provision of insights concerning the contents of speech audio stored as a specified one of the speech data sets 3100. The processor 2750 may be subsequently caused to similarly provide a UI by which the operator of the requesting device 2700 is able to view the text of that speech audio upon receipt of its transcript in the form of a text data set 3700 from the control device 2500, and/or is able to view various derived insights concerning the transcript. Again, in some embodiments, such visualizations may have been previously generated and then provided to the requesting device for presentation to convey such insights. Alternatively or additionally, the processor 2750 may be caused to generate such visualizations from information contained within text metadata 3779 associated with a text data set 3700.

FIGS. 15A, 15B, 15C, 15D, 15E and 15F, taken together, illustrate, in greater detail, aspects of one implementation of an end-to-end framework within an embodiment of the distributed processing system 2000 of FIGS. 14A-C to provide improved insights into the contents of speech audio. Within this implementation of the end-to-end framework across multiple devices 2300 and 2500, various pieces of information concerning speech audio are routed through multiple processing operations in which data is analyzed and transformed in multiple ways to derive a transcript of the contents of the speech audio, and then to derive insights concerning those contents. FIGS. 15A-B illustrates aspects of distributed pre-processing operations that are performed across the control device 2500 and multiple node devices 2300 to determine the manner in which speech audio stored as a speech data set 3100 is to be divided into speech segments (represented as data segments 3140), or sets of speech segments 3140, for speech-to-text processing operations. FIGS. 15C-D illustrate aspects of distributed speech-to-text processing operations that are performed across the control device 2500 and multiple node devices 2300 to generate a transcript (stored as a text data set 3700) of what was spoken in the speech audio, including the use of a corpus of a selected language (stored as a corpus data set 3400). FIGS. 15E-F illustrate aspects of distributed text analytics post-processing operations that are performed across the control device 2500 and multiple node devices 2300 to derive insights (which may be stored as text metadata 3379) into the contents of the speech audio and/or to identify transcripts (stored as other text data sets 3700) of other related pieces of speech audio.

Turning to FIG. 15A, a speech data set 3100 representing speech audio spoken by one or more individuals in a digitally encoded form in storage (e.g., within the storage device(s) 2100) may be divided into a set of multiple chunks of the speech audio of equal length, represented as a set of multiple data chunks 3110. Such multiple data chunks 3110 may then be provided to each of multiple node devices 2300 for pause detection.

Within each of the multiple node devices 2300, a different pause detection technique may be performed to proceed through the multiple chunks of speech audio represented by the multiple data chunks 3110 to identify the longer pauses that typically occur between sentences. It should be noted that the division of the speech data set 3100 into the multiple data chunks 3110 may be necessary to accommodate input data size limitations imposed by one or more of the pause detection techniques. Different components of, and/or different versions of, the control routine 2310 may be executed within each node device 2300 of the multiple node devices 2300 to cause the performance of a different one of the multiple pause detection techniques within each of those node devices 2300. As a result, within each of those node devices 2300, a different set of likely sentence pauses may be derived. Indications of the separately derived sets of likely sentence pauses may then be provided to the control device 2500 by each of the multiple node devices 2300 as a separate pause set 3116.

Turning to FIG. 15B, following the receipt of the multiple pause sets 3116, the control device 2500 may provide copies of the multiple pause sets 3116 to the at least one node device 2350 that may perform a speaker diarization technique. Again, just a single speaker diarization technique may be performed in some embodiments, while multiple speaker diarization techniques may be performed in other embodiments. Also in preparation for the performance of at least one speaker diarization technique, the speech data set 3100 may again be divided into a set of multiple chunks of the speech audio of equal length (again represented as a set of multiple data chunks 3110). Such multiple data chunks 3110 may then be provided to each of the one or more node devices 2300 that is to perform a speaker diarization technique.

Within each node device 2300 that is to perform a speaker diarization technique, the division of the speech data set 2310 into multiple data chunks 3110 may again be necessary to accommodate input data size limitations imposed by a speaker diarization technique. Different components of, and/or different versions of, the control routine 2310 may be executed within each node device 2300 of the at least one node device 2300 that performs a speaker diarization technique to detect instances of a likely change of speaker in the speech audio. As a result, within each node device 2300 of the at least one node device 2300, a different set of likely speaker changes may be derived (although, again, as depicted, it may be that there is just one node device 2300 that performs a speaker diarization technique, and therefore, just one set of likely speaker changes is derived). Indications of the derived set of likely speaker changes from each speaker diarization technique may then be provided to the control device 2500 as a separate change set 3118.

Within the control device 2500 the sets of indications of likely sentence pauses from the pause sets 3116 may be combined in any of a variety of ways to derive a single set of likely sentence pauses. Similarly, if more than one speaker diarization technique was performed, then the sets of indications of likely speaker changes from multiple change sets 3118 may be similarly combined into a single set of likely speaker changes. The single set of likely sentence pauses and the single set of likely speaker changes may then both be used to generate a single segmentation set 3119 of indications of the manner in which the speech data set 3100 is to be divided into the segments that will be used as inputs to the subsequent text-to-speech processing operations to be performed.

Turning to FIG. 15C, following such pre-processing operations as are described just above, the same speech data set 3100 representing the same speech audio may be divided, again, but now into a set of multiple speech segments that are each represented by a data segment 3140. Unlike the division into multiple chunks of speech audio that did not in any way take into account the content of the speech audio, the division of the speech audio into multiple speech segments may be based on the indications of where sentence pauses and/or speaker changes have been deemed to be likely to be present within the speech audio, as indicated by the segmentation set 3119.

Also unlike the provision of the same full set of multiple data chunks 3110 to each of the multiple node devices 2300 in which a different segmentation technique was performed, each of multiple node devices 2300 may be provided with one or more different ones of the data segments 3140. Within each of the multiple node devices 2300 that are provided with at least one of the data segments 3140, execution of the control routine 2340 may cause each such provided data segment 3140 to be divided into multiple data frames 3141 of equal length. In so doing, the speech segment represented by each of such data segments 3140 is divided into multiple speech frames that are each represented by one of the data frames 3141. It should be noted that, since each of the data segments 3140 are likely to be of a different size (as a result of each of the speech segments represented thereby likely being of a different temporal length), the division of each data segment 3140 into multiple data frames 3141 may result in different quantities of data frames 3141 being generated from each data segment 3140.

Following the division of a data segment 3140 into multiple data frames 3141 within each of the multiple node devices 2300, each of those data frames 3141 may then be subjected to feature detection in which the speech frame represented by each is analyzed to identify any occurrences of one or more selected acoustic features therein. For each data frame 3141, a corresponding feature vector 3142 may be generated that includes indications of when each identified acoustic feature was found to have occurred within the corresponding speech frame. Each feature vector 3142 of the resulting set of feature vectors 3142 corresponding to the set of data frames 3141 of a single segment 3140 may then be provided as an input to an acoustic model that is caused to be implemented within each of the multiple node devices 2300 by further execution of the control routine 2340. The acoustic model may map each occurrence of a particular acoustic feature, or each occurrence of a particular sequence of acoustic features, to one or more graphemes that may have been pronounced and/or to a pause that may have occurred. More specifically, for each feature vector 3142, the acoustic model may generate one or more probability distributions of one or more graphemes (which may correspond to one or more phonemes that may be represented by corresponding text character(s)) that were pronounced, and/or one or more pauses that occurred within the corresponding speech frame. The probability distributions so derived from all of the feature vectors that correspond to a single speech segment may be assembled together in temporal order to form a single probability distribution set 3143 that corresponds to that single speech segment.

Turning to FIG. 15D, each of the probability distribution sets 3143, following its generation within a different one of the multiple node devices 2300, may then be provided to the control device 2500. Also, each of the multiple node devices 2300 may be provided with a complete copy of a corpus data set 3400 that includes an n-gram language model.

Within the control device 2500, execution of the control routine 2540 may cause the probability distributions of graphemes and/or of pauses within each of the probability distribution sets 3143 to be analyzed in temporal order to derive a set of up to a pre-selected quantity of candidate words that are each among the words that are each more likely to be the next word that was spoken. Each word of this set of candidate words may then be combined with up to a pre-selected quantity of earlier-identified preceding words to form a corresponding set of candidate n-grams that are to be searched for within the corpus data set 3400. The set of candidate n-grams may then be provided to the multiple node devices 2300 to enable the performance of a beam search through the corpus of the corpus data set 3400 in a distributed manner across the multiple node devices 2300, as will be explained in greater detail.

Within each of the multiple node devices 2300, in executing the control routine 2340, a different subset of the set of candidate n-grams is searched for within the corpus represented by the corpus data set 3400, as will also be explained in greater detail. Within each of the multiple node devices 2300, as the probability for each candidate n-gram of the subset is retrieved from the corpus of the corpus data set 3400 as a result of the search, indications of those probabilities may be transmitted back to the control device 2500.

Within the control device 2500, following the receipt of the probabilities for all of the candidate n-grams within the set of candidate n-grams from the node devices 2300, the one candidate n-gram within the set that has the highest probability may be identified. In so doing, the corresponding candidate word out of the set of candidate words is selected as being the word that was mostly likely the next word spoken. That word may then be added to the transcript of the speech audio of speech data set 3100, which may be stored within the control device 2500 as a text data set 3700.

Turning to FIG. 15E, following the generation of a complete transcript of what was said in the speech audio of the speech data set 3100, the transcript may be stored within the one or more storage devices 2100 as the corresponding text data set 3700. The text data set 3700 may include an identifier of the speech data set 3100 from which the transcript of the text data set 3700 was derived.

Within the control device 2500, in executing the control routine 2570, various post-processing analyses may be performed of the text within the transcript to identify such features as the one or more topics that were spoken about, the relative importance of each topic, indications of sentiments, etc. More specifically, using the transcript of the text data set 3700 as an input, one or more terms within the transcript (each including one or more words) may be identified as having one or more quantifiable characteristics (e.g., counts of occurrences of each term and/or aggregate counts of multiple terms, degree of relevance of a term within the transcript, degree of strength of positive or negative sentiment about a term, etc.), and/or relational characteristics (e.g., semantic and/or grammatical relationships among terms, whether detected sentiment about a term is positive or negative, etc.)

In some embodiments, the entirety of the transcript may be provided to each of multiple ones of the node devices 2300 to enable each to perform a different post-processing analysis on the entirety of the transcript. As part of one or more of such analyses, sets of n-grams from the transcript may be provided to the multiple node devices 2300 to be searched for within the corpus data set 3400 as part of using n-gram probabilities in identifying topics, indications of sentiments about topics, etc. Regardless of the exact types of text analyses that are performed, and regardless of the exact manner in which each text analysis is performed, the various insights that may be derived from such analyses may be assembled as corresponding text metadata 3779 that may also be stored within the one or more storage devices 2100.

Turning to FIG. 15F, following the derivation of the text metadata 3779 corresponding to the text data set 3700, further execution of the control routine 2570 may cause the retrieval of text metadata 3779 corresponding to other text data sets 3700 that correspond to other speech data sets 3100. Such other text metadata 3779 may be analyzed to identify relationships among words, text chunks, utterances, topics, etc. that may lead to the identification of other text data sets 3700 generated from other speech data sets 3100 that may be deemed to be related.

In further executing the control routine 2570, the control device 2500 may be cause to provide the text data set 3700, the corresponding text metadata 3779, and/or text metadata 3779 of other related speech data set(s) 3100 and/or text data set(s) 3700 to the requesting device 2700. It may be that the request to provide various insights into what was spoken in the speech audio of the speech data set 3100 was received by the control device 2500 from the requesting device 2700. In executing the control routine 2740, images of the transcript of the text data set 3700, various visualizations of aspects of the contents thereof indicated in the corresponding text metadata 3779, and/or visualizations of identified relationships to other transcripts of other speech audio may be presented to an operator of the requesting device 2700.

FIGS. 16A, 16B, 16C, 16D, 16E and 16F, taken together, illustrate, in greater detail, aspects of one implementation of an end-to-end framework within an embodiment of the distributed processing system 2000 of FIG. 14D-F to provide improved insights into the contents of speech audio. Within this implementation of the end-to-end framework across multiple threads within a single node device 2300, various pieces of information concerning speech audio are routed through multiple processing operations in which data is analyzed and transformed in multiple ways to derive a transcript of the contents of the speech audio, and then to derive insights concerning those contents. FIGS. 16A-C illustrates aspects of distributed pre-processing operations that may be performed across multiple threads within a single node device 2300 to determine the manner in which speech audio stored as a speech data set 3100 is to be divided into speech segments (represented as data segments 3140), or sets of speech segments 3140, for speech-to-text processing operations. FIGS. 16D-E illustrate aspects of distributed speech-to-text processing operations that may be performed across multiple threads within a single node device 2300 to generate a transcript (stored as a text data set 3700) of what was spoken in the speech audio, including the use of a corpus of a selected language (stored as a corpus data set 3400). FIG. 16F illustrates aspects of distributed text analytics post-processing operations that may be performed across multiple threads within a single node device 2300 to derive insights (which may be stored as text metadata 3379) into the contents of the speech audio and/or to identify transcripts (stored as other text data sets 3700) of other related pieces of speech audio.

Turning to FIG. 16A, a speech data set 3100 representing speech audio spoken by one or more individuals in a digitally encoded form in storage (e.g., within the storage device(s) 2100) may be divided into a set of multiple chunks of the speech audio of equal length, represented as a set of multiple data chunks 3110. Such multiple data chunks 3110 may then be provided to each of one or more threads 2454 within a single node device 2300 for pause detection.

It may be that within each of the one or more threads 2454 within a single node device 2300, a different pause detection technique may be performed to proceed through the multiple chunks of speech audio represented by the multiple data chunks 3110 to identify the longer pauses that typically occur between sentences. Again, the division of the speech data set 3100 into the multiple data chunks 3110 may be necessary to accommodate input data size limitations imposed by one or more of the pause detection techniques. Different components of, and/or different versions of, the control routine 2310 may be executed within each of the one or more threads 2454 to cause the performance of a different one of the multiple pause detection techniques within each of those threads 2454. As a result, within each of those threads 2454, a different set of likely sentence pauses may be derived.

Turning to FIG. 16B, the multiple pause sets 3116 may then be provided to each of one more threads 2545 within the same node device 2300 to perform one or more speaker diarization techniques. Just a single speaker diarization technique may be performed within a single thread 2545 in some embodiments, while multiple speaker diarization techniques may each be performed within a separate thread 2545 in other embodiments. Also in preparation for the performance of at least one speaker diarization technique, the speech data set 3100 may again be divided into a set of multiple chunks of the speech audio of equal length (again represented as a set of multiple data chunks 3110). Such multiple data chunks 3110 may then be provided to each of the one or more threads 2545 in which a speaker diarization technique is to be performed.

Within each thread 2545 in which a speaker diarization technique is to be performed, the division of the speech data set 2310 into multiple data chunks 3110 may again be necessary to accommodate input data size limitations imposed by a speaker diarization technique. Different components of, and/or different versions of, the control routine 2310 may be executed within each thread 2545 of the one or more threads 2545 in which a speaker diarization technique is performed to detect instances of a likely change of speaker in the speech audio. As a result, within each such thread 2545, a different set of likely speaker changes may be derived (although, again, as depicted, it may be that there is just one thread 2545 in which a speaker diarization technique is performed, and therefore, just one set of likely speaker changes is derived).

Turning to FIG. 16C, within the same single node device 2300, the sets of indications of likely sentence pauses from the pause sets 3116 may be combined in any of a variety of ways to derive a single set of likely sentence pauses. Similarly, if more than one speaker diarization technique was performed, then the resulting change sets 3118 of indications of likely speaker changes may be similarly combined into a single set of likely speaker changes. The single set of likely sentence pauses and the single set of likely speaker changes may then both be used to generate a single segmentation set 3119 of indications of the manner in which the speech data set 3100 is to be divided into the segments that will be used as inputs to the subsequent text-to-speech processing operations to be performed.

Turning to FIG. 16D, following such pre-processing operations as are described just above, the same speech data set 3100 representing the same speech audio may be divided, again, but now into a set of multiple speech segments that are each represented by a data segment 3140. Again, unlike the division into multiple chunks of speech audio that did not in any way take into account the content of the speech audio, the division of the speech audio into multiple speech segments may be based on the indications of where sentence pauses and/or speaker changes have been deemed to be likely to be present within the speech audio, as indicated by the segmentation set 3119.

It may be that all data segments 3140 are initially provided to a single thread 2545 within the single node device 2300 for feature and grapheme detection. Alternatively, it may be that different subsets of the data segments 3140 are each provided to a different thread 2545 of multiple threads for at least partially parallel performances of feature and grapheme detection. Within each of such one or more threads 2454, execution of the control routine 2340 may cause each such provided data segment 3140 to be divided into multiple data frames 3141 of equal length. In so doing, the speech segment represented by each of such data segments 3140 is divided into multiple speech frames that are each represented by one of the data frames 3141. It should be noted that, since each of the data segments 3140 are likely to be of a different size (as a result of each of the speech segments represented thereby likely being of a different temporal length), the division of each data segment 3140 into multiple data frames 3141 may result in different quantities of data frames 3141 being generated from each data segment 3140.

Following the division of a data segment 3140 into multiple data frames 3141 within each of such threads 2454, each of those data frames 3141 may then be subjected to feature detection in which the speech frame represented by each data frame 3141 is analyzed to identify any occurrences of one or more selected acoustic features therein. For each data frame 3141, a corresponding feature vector 3142 may be generated that includes indications of when each identified acoustic feature was found to have occurred within the corresponding speech frame. Each feature vector 3142 of the resulting set of feature vectors 3142 corresponding to the set of data frames 3141 of a single segment 3140 may then be provided as an input to an acoustic model that is caused to be implemented within the single node device 2300 by further execution of the control routine 2340. Again, the acoustic model may map each occurrence of a particular acoustic feature, or each occurrence of a particular sequence of acoustic features, to one or more graphemes that may have been pronounced and/or to a pause that may have occurred. Again, for each feature vector 3142, the acoustic model may generate one or more probability distributions of one or more graphemes (which may correspond to one or more phonemes that may be represented by corresponding text character(s)) that were pronounced, and/or one or more pauses that occurred within the corresponding speech frame. The probability distributions so derived from all of the feature vectors that correspond to a single speech segment may be assembled together in temporal order to form a single probability distribution set 3143 that corresponds to that single speech segment.

Turning to FIG. 16E, the multiple probability distribution sets 3143, after being generated all within a single thread 2454 or across multiple threads 2454 within the node devices 2300, may then be distributed among multiple threads 2545. As previously discussed, it is the speech-to-text operations that have been found to consume the greatest amounts of processing resources, especially performances of beam searches. Thus, although the use of multiple threads 2454 has been discussed above as being potentially used for various pre-processing operations, it is envisioned that multiple threads 2454 within the single node device 2300 may be used primarily to enable at least beam searches to be performed at least partially in parallel to alleviate potential bottlenecks arising from the performance of this part of the speech-to-text operations.

As will be explained in greater detail, a queue may be instantiated and maintained for use in distributing individual probability distribution sets 3143 among multiple threads in temporal order as each of those multiple threads become available to accept a probability distribution set 3143 as an input. Within each of those multiple threads 2545, execution of the control routine 2340 may cause the probability distribution of graphemes and/or of pauses within the probability distribution set 3143 that is assigned to that thread 2454 to be analyzed to derive a set of up to a pre-selected quantity of candidate words that are each among the words that are each more likely to be the next word that was spoken. Each word of this set of candidate words may then be combined with up to a pre-selected quantity of earlier-identified preceding words to form a corresponding set of candidate n-grams that are to be searched for within the corpus data set 3400. Beam searches may then be performed through the corpus of the corpus data set 3400 to retrieve a probability for each candidate n-gram to identify tine candidate n-gram within the set that has the highest probability. The corresponding candidate word out of the set of candidate words is then selected as being the word that was mostly likely the next word spoken. That word may then be added to the transcript of the speech audio of speech data set 3100, which may be stored within the control device 2500 as a text data set 3700.

Turning to FIG. 16F, following the generation of a complete transcript of what was said in the speech audio of the speech data set 3100, the transcript may be stored within the one or more storage devices 2100 as the corresponding text data set 3700. The text data set 3700 may include an identifier of the speech data set 3100 from which the transcript of the text data set 3700 was derived.

Following the generation of the corresponding text data set 3700, it may be that various post-processing analyses may be performed of the text within the transcript to identify such features as the one or more topics that were spoken about, the relative importance of each topic, indications of sentiments, etc. More specifically, using the transcript of the text data set 3700 as an input, one or more terms within the transcript (each including one or more words) may be identified as having one or more quantifiable characteristics (e.g., counts of occurrences of each term and/or aggregate counts of multiple terms, degree of relevance of a term within the transcript, degree of strength of positive or negative sentiment about a term, etc.), and/or relational characteristics (e.g., semantic and/or grammatical relationships among terms, whether detected sentiment about a term is positive or negative, etc.)

In some embodiments, the entirety of the transcript may be provided to a single node device 2300. It may be that the transcript is provided in its entirety to each of multiple threads 2454 to enable each one of a set of different post-processing analyses to be performed at least partially in parallel on the entirety of the transcript. As part of one or more of such analyses, sets of n-grams from the transcript may be provided to such one or more threads 2454 to be searched for within the corpus data set 3400 as part of using n-gram probabilities to identify topics, indications of sentiments about topics, etc. Regardless of the exact types of text analyses that are performed, and regardless of the exact manner in which each text analysis is performed, the various insights that may be derived from such analyses may be assembled as corresponding text metadata 3779 that may also be stored within the one or more storage devices 2100.

Again, following the derivation of the text metadata 3779 corresponding to the text data set 3700, the text metadata 3779 may be analyzed to identify relationships among words, text chunks, utterances, topics, etc. that may lead to the identification of other text data sets 3700 generated from other speech data sets 3100 that may be deemed to be related. The text data set 3700, the corresponding text metadata 3779, and/or text metadata 3779 of other related speech data set(s) 3100 and/or text data set(s) 3700 may be provided to the requesting device 2700. Again, in executing the control routine 2740, images of the transcript of the text data set 3700, various visualizations of aspects of the contents thereof indicated in the corresponding text metadata 3779, and/or visualizations of identified relationships to other transcripts of other speech audio may be presented to an operator of the requesting device 2700.

FIGS. 17A, 17B and 17C, taken together, illustrate an example of use of an adaptive peak amplitude (APA) pause detection technique as part of performing pre-processing operations to derive a manner of dividing the speech audio of a speech data set 3100 into segments (each represented in storage by a data segment 3140). FIG. 17A illustrates the initial division of the speech data set 3100 into data chunks 3110 a that each represent a chunk of the speech audio of the speech data set 3100, and the measurement of peak amplitude levels to derive a threshold amplitude 2232. FIG. 17B illustrates the use of the threshold amplitude 2232 to categorize each of the data chunks 3110 a as either a speech data chunk 3110 s or a pause data chunk 3110 p. FIG. 17C illustrates the identification of sets of consecutive pause data chunks 3110 p that represent likely sentence pauses for inclusion in a pause set 3116 a of indications of likely sentence pauses within the speech audio of the speech data set 3100.

As previously discussed, in the distributed processing system 2000 depicted in FIGS. 14A-C, it may be that, for each speech data set 3110, each one of multiple pause detection techniques is assigned to be performed by a different one of the node devices 2300. Thus, each one of such assigned node devices 2300 derives a different pause set 3116 of indications of likely sentence pauses for subsequent use as one of the inputs for deriving a segmentation set 3119 of indications of segments into which the speech data set 3100 is to be divided.

Alternatively, and as also previously discussed, in the distributed processing system 2000 depicted in FIGS. 14D-F, it may be that, for each speech data set 3110, each of the multiple pause detection techniques is assigned to be performed within a separate one of multiple execution threads 2454 supported by processor(s) 2350 of a single node device 2300. Thus, each of the multiple pause sets 3116 of indications of likely sentence pauses would be derived on a different one of those assigned threads 2454 within the single node device 2300. However, as also discussed in reference to the distributed processing system 2000 of FIGS. 14D-F, it may be that, for each speech data set 3110, multiple ones of the pause detection techniques are performed on a single thread 2454 within a single node device 2300, while other operations that consume greater resources (e.g., beam searches) may be performed across multiple threads 2454 within the same single node device 2300.

Turning to FIG. 17A, in executing a division component 2311 of the control routine 2310, processor(s) 2350 of a node device 2300 a allocated for performing this APA pause detection technique, or of a node device 2300 on which multiple pause detection techniques are performed, may be caused to divide a speech data set 3100 into multiple data chunks 3110 a. In so doing, an indication of the length of the speech audio that is to be represented by each data chunk 3110 a may be retrieved from the configuration data 2335 in embodiments in which at least the majority of the data chunks 3110 a are to represent audio of equal length.

It should be noted that, in some embodiments, the pre-processing operations may also include normalizing the digital format in which the speech audio is stored as a speech data set 3100. Thus, it may be, that prior to or as part of dividing the speech audio into chunks, the digital format in which the speech audio is stored as the speech data set 3100 may be changed to a pre-selected format that specifies one or more of a particular sampling frequency, data width and/or type of data value per sample, a particular type of compression (or no compression), etc. It may be that such a pre-selected format is necessitated for sake of compatibility with one or more components for performing one or more of the pre-processing operations, and/or one or more of the processing operations of the speech-to-text conversion.

In executing an amplitude component 2312 of the control routine 2310, processor(s) 2350 may be caused to analyze each of the data chunks 3110 a to measure the peak amplitude of the chunk of speech audio present within each. With all of the peak amplitudes across all of the data chunks 3110 a so measured, a level of amplitude of a preselected percentile of all of the peak amplitudes may be derived and used as a threshold amplitude 2232. In so doing, an indication of the preselected percentile may be retrieved from the configuration data 2335.

As previously discussed, it may be that the multiple pause detection techniques are assigned relative weighting factors that are used in combining the resulting multiple pause sets 3116 of likely sentence pauses to derive the segmentation set 3119 of indications of the manner in which the speech data set 3100 is to be divided to form segments, and it may be that the relative weighting factors are adjusted based on the level of audio noise that is present across the chunks of the speech audio. In such embodiments, and as depicted, it may be that execution of the amplitude component 2312 also causes the measurement of the level of audio noise in the chunk of speech audio within each of the data chunks 3110 a, and causes the derivation of an audio noise level 3112 that is in some way representative of the level of audio noise present within the entire speech audio. In various embodiments, the audio noise level 3112 may be indicative of the minimum level of audio noise measured across all of the data chunks 3110 a, an average thereof, and/or of any of a variety of other characteristics of audio noise.

Turning to FIG. 17B, in executing a categorization component 2315 of the control routine 2310, processor(s) 2350 may be caused to use the threshold amplitude 2232 to categorize each of the data chunks 3110 a as either a speech data chunk 3110 s or a pause data chunk 3110 p. More specifically, all of the data chunks 3110 a that each represent a chunk of speech audio with a measured peak amplitude above the threshold amplitude 2232 are deemed to be speech data chunks 3110 s, while all of the data chunks 3110 a that each represent a chunk of the speech audio with a measured peak amplitude below the threshold amplitude 2232 are deemed to be pause data chunks 3110 p.

Turning to FIG. 17C, in executing a pause identification component 2317 of the control routine 2310, processor(s) 2350 may be caused to adaptively identify longer pauses defined by larger quantities of consecutive pause data chunks 3110 p as likely sentence pauses. More specifically, and starting with the data chunk 3110 a that represents the temporally earliest chunk of the speech audio of the speech data set 3100, a window 2236 that covers a preselected quantity of temporally consecutive ones of the data chunks 3110 a may be shifted across the length of the speech audio, starting with the temporally earliest data chunk 3110 a and proceeding throughout all of the data chunks 3110 a in temporal order toward the temporally last data chunk 3110 a. Thus, with the window 2236 positioned to begin with the earliest data chunk 3110 a (regardless of whether it is a pause data chunk 3110 p or a speech data chunk 3110 s), measurements of the lengths of each pause represented by multiple consecutive pause data chunks 3110 p within the window 2236 (if there are any pauses represented by multiple consecutive pause data chunks 3110 p within the window 2236) may be taken to identify the longest pause thereamong. The longest pause that is so identified within the window 2236 (i.e., the pause represented by the greatest quantity of consecutive pause chunks 3110 p) may then be deemed likely to be a sentence pause.

The window 2236 may then be shifted away from the earliest data chunk 3110 a and along the data chunks 3110 of the speech audio in temporal order so as to cause the window 2236 to next begin either amidst the just-identified likely sentence pause (e.g., beginning at the midpoint thereof) of just after the just-identified likely sentence pause (e.g., as depicted, immediately after the temporally last data chunk of the consecutive pause data chunks 3110 p that define the just-identified likely sentence pause). With the window 2236 so repositioned, again, measurements of the lengths of each pause represented by multiple consecutive pause data chunks 3110 p within the window 2236 may be taken to again identify the longest pause thereamong. Again, the longest pause that is so identified within the window (i.e., the pause represented by the greatest quantity of consecutive pause chunks 3110 p within the window 2236) may be deemed likely to be a sentence pause. As depicted, this may be repeated until the window 2236 has been shifted along the entirety of the length of the speech audio (i.e., from the temporally earliest data chunk 3110 a to the temporally latest data chunk 3110 a).

For each of the pauses that has been deemed a likely sentence pause within the speech audio 3100 using the APA technique, an indication of that likely sentence pause may be generated and stored as part of the pause set 3116 a. More precisely, indications of where each likely sentence pause starts and ends within the speech audio may be stored within the pause set 3116 a, and/or indications of where the midpoint of each likely sentence pause is located within the speech audio and/or its length may be so stored. The manner in which such locations within the speech audio are described may be as amounts of time from the beginning of the speech audio represented by the speech data set 3100.

In so identifying likely sentence pauses through such use of the window 2236, it may be that an indication of what the length of the window 2236 should be (i.e., how many consecutive data chunks 3110 a it should span) may be retrieved from the configuration data 2335. The length of the window 2236 may be selected to ensure that there cannot be a distance between the midpoints of any adjacent pair of likely sentence pauses that is greater than a capacity limitation that may be present in subsequent processing operations of the speech-to-text conversion. Alternatively or additionally, the length of the window 2236 may be selected to increase the likelihood that a sentence pause will be identified each time the window 2236 is re-positioned, based on the typical length of sentences in whichever language is used for the speech audio.

Further, in some embodiments, it may be that any instances of an adjacent pair of likely sentence pauses that are closer to each other than a predetermined threshold period of time are not permitted. An indication of the length of the predetermined threshold period of time (which may also be expressed as a quantity of consecutive data chunks 3110 a) may also be retrieved from the configuration data 2335. It may be that, wherever such a pair of likely sentence pauses might occur, that an indication of one of the two likely sentence pauses may be dropped from those that are included in the pause set 3116 a. The selection of which of two such likely sentence pauses is the one to be dropped may be based on which is shorter than the other, and/or may be based on a requirement that the dropping of one or the other should not be allowed to create a distance between any of two of the remaining likely sentence pauses that is greater than the length of the window 2236, which may be treated as an upper limit on the distance between any two of the likely sentence pauses.

FIGS. 18A and 18B, taken together, illustrate an example of use of a connectionist temporal classification (CTC) pause detection technique as part of performing pre-processing operations to derive a manner of dividing the same speech audio of the same speech data set 3100 into segments. FIG. 18A illustrates the initial division of the speech data set 3100 into data chunks 3110 c that each represent a chunk of the speech audio of the speech data set 3100, and the provision of those data chunks 3110 c as an input to an acoustic model neural network 2234 with CTC output 2235. FIG. 18B illustrates the use of that acoustic model neural network 2234 to identify likely sentence pauses for inclusion in a pause set 3116 c of indications of likely sentence pauses within the speech audio of the speech data set 3100.

Again, as previously discussed, in the distributed processing system 2000 depicted in FIGS. 14A-C, it may be that, for each speech data set 3110, each one of multiple pause detection techniques is assigned to be performed within a different one of the node devices 2300. Thus, each one of such assigned node devices 2300 derives a different pause set 3116 of indications of likely sentence pauses for subsequent use as one of the inputs for deriving a segmentation set 3119 of indications of segments into which the speech data set 3100 is to be divided.

Alternatively, and again, as also previously discussed, in the distributed processing system 2000 depicted in FIGS. 14D-F, it may be that, for each speech data set 3110, each of the multiple pause detection techniques is assigned to be performed within a separate one of multiple execution threads 2454 supported by processor(s) 2350 of a single node device 2300. Thus, each of the multiple pause sets 3116 of indications of likely sentence pauses would be derived on a different one of those assigned threads 2454 within the single node device 2300. However, as also discussed in reference to the distributed processing system 2000 of FIGS. 14D-F, it may be that, for each speech data set 3110, multiple ones of the pause detection techniques are performed on a single thread 2454 within a single node device 2300, while other operations that consume greater resources (e.g., beam searches) may be performed across multiple threads 2454 within the same single node device 2300.

Turning to FIG. 18A, in executing the division component 2311 of the control routine 2310, processor(s) 2350 of a node device 2300 c allocated for performing this CTC pause detection technique, or of a node device 2300 on which multiple pause detection techniques are performed, may be caused to divide the same speech data set 3100 as was featured in FIGS. 17A-C into multiple data chunks 3110 c. In so doing, an indication of the length of the speech audio that is to be represented by each data chunk 3110 c may be retrieved from the configuration data 2335. It should be noted that the data chunks 3110 c of this CTC pause detection technique may not represent the same length of the speech audio as are represented by the data chunks 3110 a of the APA pause detection technique of FIGS. 17A-C. Indeed, it is envisioned that the data chunks 3110 c are each likely to represent a greater length of speech audio such that the speech audio represented by a single one of the data chunks 3110 c may match the length of the speech audio represented by multiple ones of the data chunks 3110 a.

Again, in some embodiments, the pre-processing of speech audio may include normalizing the digital format in which the speech audio is stored as a speech data set 3100. Thus, it may again be that, prior to or as part of dividing the speech audio into chunks, the digital format in which the speech audio is stored may be changed to a pre-selected format that specifies one or more of a particular sampling frequency, data width and/or type of data value per sample, a particular type of compression (or no compression), etc.

As will be familiar to those skilled in the art, at least some acoustic models implemented using neural networks (and/or other technologies) may accept indications of detected audio features as input, instead of accepting audio data (e.g., the data chunks 3110 c) more directly as input. To accommodate the use of such implementations of an acoustic model, execution of the control routine 2310 may entail execution of a feature detection component 2313 to analyze the portion of speech audio represented by each data chunk 3110 c to identify instances of each of a pre-selected set of acoustic features. In so doing, processor(s) 2350 may be caused to generate a corresponding feature vector 3113 from each data chunk 3110 c that is analyzed. Each feature vector 3113 may include indications of each acoustic feature that is identified and when it occurred within the speech audio of the corresponding data chunk 3110 c.

In executing a configuration component 2314, processor(s) 2350 may be caused to instantiate and configure an acoustic model neural network 2234 to implement an acoustic model. As previously discussed, and as depicted, the acoustic model neural network 2234 incorporates a CTC output 2235, thereby augmenting the output of text characters by the acoustic model neural network 2234 with the output of blank symbols. As also previously discussed, in embodiments in which at least a subset of the node device(s) 2300 include one or more neuromorphic devices 2355, the acoustic model neural network 2234, along with its CTC output 2235, may be instantiated within one or more of the neuromorphic devices 2355 such that the acoustic model neural network 2234 may be implemented in hardware. Alternatively, in embodiments that lack the incorporation of neuromorphic devices, it may be that the acoustic model neural network 2234 is implemented in software.

As previously discussed, an acoustic model neural network incorporating a CTC output is normally used to accept indications of acoustic features detected within speech audio, and to output indications of the probabilities of which one or more text characters are likely to correspond to those acoustic features (e.g., probability distributions for text characters). With the addition of the CTC output, the probabilistic indications of likely text characters are augmented with blank symbols that are intended to identify instances where there are likely to be consecutive occurrences of the same text character (e.g., the pair of “1” characters in the word “bell”), despite the absence of an acoustic feature that would specifically indicate such a situation (e.g., no acoustic feature in the pronunciation of the “1” sound in the word “bell” that indicates that there are two consecutive “1” characters therein).

Broadly, CTC outputs have been used to aid in temporally aligning a sequence of indications of features that have been observed (e.g., acoustic features in speech sounds, or visual features in handwriting), with a sequence of labels (e.g., text characters, phonemes and/or graphemes) where there may be differences between the density of input observations over a period of time and the density of labels that are output for that same period of time. Such a CTC output has been used to generate blank symbols that may be used as a guide in performing such an alignment, including blank symbols that indicate where there may be multiple ones of the same label that are consecutively output that might otherwise be mistakenly merged into a single instance of that label (as in the above-described situation of a pair of “1” text characters that should not be merged). In this way, such multiple consecutive instances of a label (e.g., of a text character) are able to be associated with what may be a single observation, or a single set of observations, that might otherwise be associated with only one instance of that label, thereby aiding in the proper aligning of the input and output sequences.

However, it has been observed (and then confirmed by experimentation) that such an acoustic model neural network with a CTC output may also be useful in identifying sentence pauses. More specifically, it has been observed that, in addition to outputting single blank symbols for such consecutive instances of a text character, such a CTC output also has a tendency to generate relatively long strings of consecutive blank symbols that correspond quite well to where sentence pauses occur.

Turning to FIG. 18B, in so using the acoustic model neural network 2234 for the detection of sentence pauses, each data chunk 3110 c is provided to the acoustic model neural network 2234 as an input. In executing the pause identification component 2316, processor(s) 2350 are caused to monitor the CTC 2235 output for occurrences of strings of consecutive blank symbols. FIG. 18B depicts an example of three consecutive data chunks 3110 c that each represent a different depicted portion of speech audio that represent the words “Hello” and “Please leave a message” spoken as two separate sentences.

Turning to the provision of the first of the three data chunks 3110 c that represents the speech sounds for portions of the words “Hello” and “Please” as an input to the acoustic model neural network 2234, the output thereof includes the letters therefor, accompanied by instances from the CTC output 2235 of the blank symbol (indicated in FIG. 18B using the “A” character) separating the corresponding characters. As shown, a single instance of the blank symbol may be output between the two consecutive instances of the “1” character of the word “Hello”, thereby exemplifying the aforedescribed function for which the CTC output 2235 is typically relied upon to perform. However, as also shown, an instance of a relatively long string of consecutive blank symbols is also output by the CTC output 2235 that corresponds with the sentence pause that occurs between these two words.

Turning to the provision of the second of the three data chunks 3110 c that represents the speech sounds for another portion of the word “Please” and the entirety of each of the two words “leave” and “a” as input to the acoustic model neural network 2234, the output thereof includes the letters therefor, also accompanied by instances from the CTC output 2235 of the blank symbol separating the corresponding characters. As shown, two instances of a relatively short string of consecutive blank symbols are also output by the CTC output 2235 that each correspond with one of the two pauses that occur between adjacent pairs of these three words.

Turning to the provision of the third of the three data chunks 3110 c that represents the speech sounds for just the word “message” as input to the acoustic model neural network 2234, the output includes the letters therefor, also accompanied by instances from the CTC output 2235 of the blank symbol separating the corresponding characters. As shown, a single instance of the blank symbol may be output between the two consecutive instances of the “s” character from this word, thereby again exemplifying the aforedescribed function for which the CTC output 2235 is typically relied upon to perform.

As each of these outputs are provided by the acoustic model neural network 2234, the length of each string of consecutive blank symbols that may be present therein is compared (as a result of execution of the pause identification component 2316) to a threshold blank string length. Where a string of consecutive blank symbols in such an output is at least as long as the threshold blank string length (e.g., the string of blank symbols corresponding to the pause between the words “Hello” and “Please”), such a string of blank symbols may be deemed likely to correspond to a sentence pause. However, where a string of consecutive symbols in such an output is not at least as long as the threshold blank string (e.g., the strings of blank symbols between the words “Please” and “leave”, and between the words “leave” and “a”), such a string of blank symbols may be deemed to not correspond to a sentence pause. Thus, in the example depicted in FIG. 18B, the pause between the words “Hello” and “Please” may be deemed to be a likely sentence pause, and an indication thereof may be included in the pause set 3116 c of likely sentence pauses.

In performing such comparisons of the lengths of strings of consecutive blank symbols to the threshold blank string length, an indication of the threshold blank string length may be retrieved from the configuration data 2335. In some embodiments, the threshold blank string length may have been previously derived during training and/or testing of the acoustic model neural network 2234 to become part of configuration information stored within the configuration data 2335 for use in instantiating and configuring the acoustic model neural network 2234 with its CTC 2235 output. During such training, it may be that portions of speech audio that are known to include pauses between sentences may be used, and the lengths of the resulting strings of blank symbols that correspond to those sentence pauses may be measured to determine what the threshold blank string length should be to enable its use in distinguishing pauses between sentences from at least pauses between words.

FIGS. 19A, 19B, 19C and 19D, taken together, illustrate an example of use of a speaker diarization technique based on the use of a speaker diarization neural network 2237 as part of performing pre-processing operations to derive a manner of dividing the same speech audio of the same speech data set 3100 into segments. FIG. 19A illustrates the initial division of the speech data set 3100 into data chunks 3110 d that each represent a chunk of the speech audio of the speech data set 3100, and the provision of those data chunks 3110 d as an input to a speaker diarization neural network 2237, and the use of that speaker diarization neural network 2237 to generate speaker vectors that are each indicative of characteristics of a speaker who speaks in the speech audio. FIGS. 19B-C, taken together, illustrate aspects of the use of the speaker vectors as points in a performance of clustering within a multi-dimensional space to identify speakers. FIG. 19D illustrates the matching of speaker identities to speaker vectors to identify likely speaker changes for inclusion in a change set 3118 of indications of likely speaker changes within the speech audio of the speech data set 3100.

As has been discussed, unlike the aforedescribed use of multiple pause detection techniques to identify likely sentence pauses, it may be that just one speaker diarization technique (such as the particular technique that is about be described in reference to FIGS. 19A-D) may be used. However, as also discussed, other embodiments are possible in which there may be multiple different speaker diarization techniques used, such that there may be multiple separate change sets 3118 that are separately and independently generated in a manner akin to what has been discussed above in generating multiple separate pause sets 3116.

Therefore, and as previously discussed, in the distributed processing system 2000 depicted in FIGS. 14A-C, it may be that, for each speech data set 3110, each speaker diarization technique of the at least one speaker diarization technique is assigned to be performed within a different one of the node devices 2300. Thus, each one of such assigned node devices 2300 derives a different change set 3118 of indications of likely changes in speaker for subsequent use as one of the inputs for deriving a segmentation set 3119 of indications of segments into which the speech data set 3100 is to be divided.

Alternatively, and as also previously discussed, in the distributed processing system 2000 depicted in FIGS. 14D-F, it may be that, for each speech data set 3110, each of the one or more speaker diarization techniques is assigned to be performed within a separate one of multiple execution threads 2454 supported by processor(s) 2350 of a single node device 2300. Thus, each of the multiple change sets 3118 of indications of likely speaker changes would be derived on a different one of those assigned threads 2454 within the single node device 2300. However, as also discussed in reference to the distributed processing system 2000 of FIGS. 14D-F, it may be that, for each speech data set 3110, multiple speaker diarization techniques are performed on a single thread 2454 within a single node device 2300, while other operations that consume greater resources (e.g., beam searches) may be performed across multiple threads 2454 within the same single node device 2300.

Turning to FIG. 19A, in executing the division component 2311 of the control routine 2310, processor(s) 2350 of a node device 2300 d allocated for performing this speaker diarization technique, or of a node device 2300 on which one or more speaker diarization techniques are performed, may be caused to divide the same speech data set 3100 as was featured in FIGS. 17A-C and 18A-B into multiple data chunks 3110 d. In so doing, an indication of the length of the speech audio that is to be represented by each data chunk 3110 d may be retrieved from the configuration data 2335. It should be noted that, in a manner similar to the data chunks 3110 a versus the data chunks 3110 c, the data chunks 3110 d of this speaker diarization technique may not represent the same length of the speech audio as are represented by either or both of the data chunks 3110 a or 3110 c.

However, unlike each of the aforedescribed uses of the division component 2311 to generate the chunks 3110 a and 3110 c, the execution of the division component 2311 in support of this speaker diarization technique may cause further subdivision of each data chunk 3110 d into a set of data fragments 3111 d. In so doing, an indication of the length of the speech audio that is to be represented by each data fragment 3111 d may also be retrieved from the configuration data 2335.

Additionally, beyond performing such a subdivision of each data chunk 3110 d into a set of data fragments 3110 d, the execution of the division component 2311 may cause the indications of likely sentence pauses within each of the pause sets 3116 generated by each of the multiple pause detection techniques to be used to identify ones of the data fragments 3111 d that represent portions of the speech audio that may not include speech sounds as a result of including at least a portion of a sentence pause. As those skilled in the art will readily recognize, attempting to identify a speaker in a portion of speech audio that does not actually include speech sounds may yield unpredictable results that may undesirably affect subsequent processing operations. Following the identification of such data fragments 3111 d, such data fragments 3111 d may be removed from within the ones of the data chunks 3110 d in which they are present. As a result, each of the data chunks 3110 d should be at least unlikely to include data fragments 3111 d that represent a portion of the speech audio that does not include any speech sounds.

Again, in some embodiments, the pre-processing of speech audio may include normalizing the digital format in which the speech audio is stored as a speech data set 3100. Thus, it may again be that, prior to or as part of dividing the speech audio into chunks, the digital format in which the speech audio is stored may be changed to a pre-selected format that specifies one or more of a particular sampling frequency, data width and/or type of data value per sample, a particular type of compression (or no compression), etc.

As previously discussed in reference to the acoustic model neural network 2234, different implementations of neural networks used in performing various functions in the processing of audio may accept indications of detected audio features as input, instead of accepting audio data (e.g., the data chunks 3110 d) more directly as input. Thus, it may be that the feature detection component 2313 is again executed to analyze the portion of speech audio represented by each data fragment 3111 d to identify instances of each of a pre-selected set of acoustic features. In so doing, processor(s) 2350 may be caused to generate a corresponding set of feature vectors 3113 from each data fragment chunk 3111 d that is analyzed.

In executing the configuration component 2314, processor(s) 2350 may be caused to instantiate and configure a speaker diarization neural network 2237. As previously discussed, in embodiments in which at least a subset of the node device(s) 2300 include one or more neuromorphic devices 2355, the speaker diarization neural network 2237 may be instantiated within one or more of the neuromorphic devices 2355 such that the speaker diarization neural network 2237 may be implemented in hardware. Alternatively, in embodiments that lack the incorporation of neuromorphic devices, it may be that the speaker diarization neural network 2237 is implemented in software.

With the speaker diarization neural network 2237 instantiated (regardless of whether it is implemented in hardware or software), the speaker diarization neural network 2237 may then be provided with the data fragments 3111 d, one at a time, as input (either directly or indirectly, such as in the form of the depicted sets of feature vectors 3113 d). For each data fragment 3111 d, the speaker diarization neural network 2237 may generate a corresponding speaker vector 3117 d that is descriptive of vocal characteristics of a speaker who is speaking in the portion of speech audio that is represented by the data fragment 3111 d. More specifically, and as previously discussed, each speaker vector 3117 d may include (or may be) a one-dimensional array of various data values (e.g., binary data values and/or other numerical data values) that are each provide an indication of a presence or absence of a vocal characteristic, a measure of a degree or level of a vocal characteristic, etc.

As those skilled in the art will readily recognize, the variation in vocal characteristics across the human race has been found to be sufficiently varied that the use of vocal characteristics as a form of identification of individual persons has been accepted for some time. Further, it has been found to be possible to train a neural network (such as the depicted speaker diarization neural network 2237) well enough to generate speaker vectors that with relatively highly consistent data values for the vocal characteristics of a particular person despite variations in the speech of that particular person that may arise under differing conditions, such as speech volume, speech speed and/or pitch associated with differing emotional states, etc. This high degree of consistency in the data values of speaker vectors associated with a particular individual more readily enables the use of such techniques as clustering to identify individual speakers.

FIGS. 19B and 19C, taken together depict various aspects of the manner in which execution of a clustering component 2318 of the control routine 2310 by processor(s) 2350 may cause the identification of speakers in the chunk of speech audio represented by a data chunk 3110 d by using each speaker vector 3117 d associated with a data fragment 3111 d thereof as a point in a multidimensional space 2239. More specifically, each data value of each speaker vector 3117 d may be treated as specifying a location along a different one of multiple axes. Thus, the set of values within each speaker vector 3117 d, when taken together, may specify a point. By way of example, and as depicted in FIG. 19B, each one of the five depicted points a, b, c, d and e may be a point within the depicted space 2239 that is specified by the data values of a corresponding speaker vector 3117 d.

It should be noted, however, that each of FIGS. 19B and 19C depict a deliberately highly simplified two-dimensional view of a deliberately simplified example of a space 2239. This deliberately highly simplified example is presented herein for purposes of enabling understanding of aspects of the use of clustering to identify speakers, and should not be taken as limiting. Indeed, as those skilled in the art will readily recognize, effective identification of speakers requires the use of speaker vectors with numerous data values such that any treatment of speaker vectors as a point within a space would necessitate the use of a space having numerous dimensions, which would be quite difficult to effectively depict in a two-dimensional image.

Referring to FIGS. 19B and 19C, as well as to FIG. 19A, the clustering component 2318 may employ any of a wide variety of clustering algorithms. As will be familiar to those skilled in the art, regardless of the exact choice of clustering algorithm that is selected for use, broadly, such factors as distance between points 2238, quantities of points 2237 within a preselected radius of a portion of the space 2239, density of points 2337 within a preselected radius of a portion of the space 2239, etc. may be used to identify each cluster 2238 of points 2237 that may be deemed to be associated a single speaker. Thus, depending on the algorithm that is selected, the clustering component 2318 may employ any of a variety of rules for determining what points 2237 belong together in a cluster 2238.

In some embodiments, the clustering component 2318 may employ multiple clustering algorithms at different stages of using clustering to identify speakers. By way of example, a spectral clustering algorithm may initially be used as new speakers continue to be identified as part of adding points associated with a single data chunk 3110 d to the space 2239. This may be done as an approach to attempting to reduce the number of dimensions of the space 2239. However, with all points associated with a single data chunk 3110 d added to the space 2239, a k-means clustering algorithm may be used in view of its affinity for handling what may still be a relatively large quantity of dimensions.

Turning more specifically to FIG. 19B, as depicted, it may be that, as each point 2237 that is specified by the data values of one of the speaker vectors 3117 of a single data chunk 3110 d is added to the space 2239, the clustering component 2318 may determine whether the addition of each point 2237 defines a new cluster 2238, again, based on such factors as quantity and/or density of points 2237 that are caused to be within a portion of the space 2239 having a preselected radius and/or other characteristics. Once a new cluster 2238 is determined to be present within the space 2239, it may be, in some clustering algorithms, that points 2237 that are near to such a portion of the space 2239, but not in it, may nonetheless be deemed to be part of the cluster 2238.

Turning more specifically to FIG. 19C, as depicted, it may be that the ongoing addition of more points 2237 leading to the identification of another cluster 2238, may then lead to a need to re-evaluate which points 2237 that have been plotted, so far, belong to which cluster 2238. More specifically, while it may be that one or both of the depicted points e and f might have initially been deemed to belong to the single cluster 1 depicted in FIG. 19B, the identification of another cluster 2 depicted in FIG. 19C may necessitate a re-evaluation of whether one or both of the points e and f should be deemed as belonging to the newer cluster 2. Thus, in at least some clustering algorithms the identification of each new cluster 2238 may trigger at least a partial repeat performance of clustering.

However, and as will be familiar to those skilled in the art, each performance of a clustering algorithm can consume an amount of processing resources that may increase exponentially with the addition of each point. To address this, it may be that each performance and repeated performance of clustering is limited to the points 2237 that correspond to the data fragments 3111 d that are present within a single data chunk 3110 d.

Turning to FIG. 19D, following the performance of clustering (including any repeat performances) to generate clusters that identify speakers present within the portion of speech audio represented by data chunk 3110 d, further execution of the clustering component 2318 may cause processor(s) 2350 to match each speaker vector 3117 d of a data fragment 3111 d of the data chunk 3110 d to one of the identified speakers. More specifically, a separate speaker identifier may be generated for each cluster 2238 that is identified (each of which is deemed to be associated with a different speaker).

Following the matching of speaker vectors 3117 d to identified speakers, the speaker identifiers of temporally adjacent speaker vectors 3117 d may be compared to identify each instance in which there is a change of speakers. For each such instance of change of speakers, an indication of a change of speakers may be added to the change set 3118.

FIGS. 20A, 20B, 20C and 20D, taken together, illustrate an example of generating the segmentation set 3119 of indications of segments in each of the embodiments of a distributed processing system 2000 of FIGS. 14A-C and FIGS. 14D-F. FIG. 20A illustrates the combining of multiple pause sets 3116 of indications of likely sentence pauses with at least one change set 3118 of indications of likely speaker changes from multiple node devices 2300 in the embodiment of FIGS. 14A-C to generate the segmentation set 3119, and FIG. 20B illustrates the use of that segmentation set 3119 in dividing the speech data set 3100 into data segments 3140 representing segments of the speech audio of the speech data set 3100 in that same embodiment. FIG. 20C illustrates the combining of multiple pause sets 3116 of indications of likely sentence pauses with at least one change set 3118 of indications of likely speaker changes from multiple threads 2454 in the embodiment of FIGS. 14D-F to generate the segmentation set 3119, and FIG. 20D illustrates the use of that segmentation set 3119 in dividing the speech data set 3100 into data segments 3140 representing segments of the speech audio of the speech data set 3100 in that same embodiment.

Turning to FIG. 20A, in executing an aggregation component 2519 of the control routine 2510, processor(s) 2550 of the control device 2500 in the embodiment of a distributed processing system 2000 of FIGS. 14A-C may be caused to combine multiple pause sets 3116 (which may be received from multiple node devices 2300, such as the specifically depicted pause sets 3116 a and 3116 c) into a single set of indications of likely sentence pauses. As previously discussed, a variety of different approaches may be used in performing such a combining of such multiple pause sets 3116, including approaches to combining in which different pause detection techniques (and therefore, different ones of the pause sets 3116) may be assigned different relative weighting factors. As depicted, and as also previously discussed, such relative weight factors may be made dynamically adjustable based on one or more characteristics of the speech audio represented by the speech data set 3100.

By way of example, and as previously discussed in connection with the APA pause detection technique of FIGS. 17A-C, it may be that audio noise level measurement(s) are taken along with the measurements of peak amplitude that are performed as part of the APA pause detection technique. In so doing, the audio noise level 3112 may be generated as an average, a peak, or other representation of the level of audio noise throughout the speech audio of the speech data set 3100. Regardless of the exact manner in which the representation of the level of audio noise within the audio noise level 3112 is generated, the audio noise level 3112 may be used as an input for dynamically adjusting the relative weighting factors assigned to the different pause sets 3116 to take into account the relative degrees of susceptibility of each pause detection technique to being adversely affected by audio noise present in the speech audio. More specifically, it may be that the CTC pause detection technique is less susceptible to audio noise than the APA pause detection technique such that the presence of a higher level of audio noise in the speech audio (as indicated by the audio noise level 3112) may cause the pause set 3116 c generated via the CTC pause detection technique to be given a greater relative weight compared to the pause set 3116 a generated via the APA pause detection technique.

Also in executing the aggregation component 2519 of the control routine 2510, processor(s) 2550 of the control device 2500 may be caused to similarly combine multiple change sets 3118 (which may also be received from multiple node devices 2300) in embodiments in which multiple different speaker diarization techniques have been similarly performed, at least partially in parallel, to similarly generate a single combined set of indications of likely speaker changes. In so doing, there may also be the use of some form of relative weighting that may also be based on the audio noise level 3112, and/or based on any of a variety of other factors. Alternatively, and as depicted, it may be that just a single speaker diarization technique was performed, resulting the generation of just a single change set 3118 (such as the specifically depicted change set 3118 d).

In further executing the aggregation component 2519 of the control routine 2510, processor(s) 2550 of the control device 2500 may be caused to then use the single set of indications of likely sentence pauses along with the single set of indications of likely speaker changes to derive a manner in which the speech audio of the speech data set 3100 is to be divided into segments of speech audio. In so doing, a set of indications of the manner in which to effect such segmentation may be stored as the segmentation set 3119.

Turning to FIG. 20B, in executing a division component 2541 of the control routine 2540, processor(s) 2550 of the control device 2500 may be caused to divide the speech data set 3100 into data segments 3140 based on the segmentation set 3119. In so doing, the speech audio represented by the speech data set 3100 may be divided into segments where the divisions between each adjacent pair of segments is caused to occur at a location at which each likely sentence pause and/or likely speaker change was determined to have occurred. As a result, each of the segments of speech audio should be at least more likely to start and end with portions of sentence pauses, and should be at least more likely to include words spoken by the same speaker(s) throughout. This should serve to increase the likelihood that the entirety of the pronunciation of each letter, of each word, and/or of each sentence is fully contained within a single one of the segments, instead of being split across the divide between two segments, and to increase the likelihood that the manner in which such speech sounds are pronounced throughout each segment should not change. In this way, the accuracy of subsequent processing operations to detect acoustic features, to identify letters, and then to identify whole words, may be improved.

Turning to FIG. 20C, in executing an aggregation component 2319 of the control routine 2310, processor(s) 2350 of a node device 2300 in the embodiment of a distributed processing system 2000 of FIGS. 14D-F may be caused to combine multiple pause sets 3116 (which may be received from multiple threads 2454 within the same node device 2300, such as the specifically depicted pause sets 3116 a and 3116 c) into a single set of indications of likely sentence pauses. Again, a variety of different approaches may be used in performing such a combining of such multiple pause sets 3116, including approaches to combining in which different pause detection techniques (and therefore, different ones of the pause sets 3116) may be assigned different relative weighting factors. Again, such relative weight factors may be made dynamically adjustable based on one or more characteristics of the speech audio represented by the speech data set 3100.

Again, as previously discussed in connection with the APA pause detection technique of FIGS. 17A-C, it may be that audio noise level measurement(s) are taken along with the measurements of peak amplitude that are performed as part of the APA pause detection technique. In so doing, the audio noise level 3112 may be generated as an average, a peak, or other representation of the level of audio noise throughout the speech audio of the speech data set 3100. Regardless of the exact manner in which the representation of the level of audio noise within the audio noise level 3112 is generated, the audio noise level 3112 may be used as an input for dynamically adjusting the relative weighting factors assigned to the different pause sets 3116 to consider the relative degrees of susceptibility of each pause detection technique to being adversely affected by audio noise present in the speech audio. Again, it may be that the CTC pause detection technique is less susceptible to audio noise than the APA pause detection technique such that the presence of a higher level of audio noise in the speech audio (as indicated by the audio noise level 3112) may cause the pause set 3116 c generated via the CTC pause detection technique to be given a greater relative weight compared to the pause set 3116 a generated via the APA pause detection technique.

Also in executing the aggregation component 2319 of the control routine 2310, processor(s) 2350 of the node device 2300 may be caused to similarly combine multiple change sets 3118 (which may also be received from multiple threads 2454 within the same node device 2300) in embodiments in which multiple different speaker diarization techniques have been similarly performed, at least partially in parallel, to similarly generate a single combined set of indications of likely speaker changes. Again, there may also be the use of some form of relative weighting that may also be based on the audio noise level 3112, and/or based on any of a variety of other factors. Alternatively, and as depicted, it may be that just a single speaker diarization technique was performed, resulting the generation of just a single change set 3118 (such as the specifically depicted change set 3118 d).

In further executing the aggregation component 2319 of the control routine 2310, processor(s) 2350 of the node device 2300 may be caused to then use the single set of indications of likely sentence pauses along with the single set of indications of likely speaker changes to derive a manner in which the speech audio of the speech data set 3100 is to be divided into segments of speech audio. In so doing, a set of indications of the manner in which to effect such segmentation may be stored as the segmentation set 3119.

Turning to FIG. 20D, in executing a division component 2341 of the control routine 2340, processor(s) 2350 of the node device 2300 may be caused to divide the speech data set 3100 into data segments 3140 based on the segmentation set 3119. Again, in so doing, the speech audio represented by the speech data set 3100 may be divided into segments where the divisions between each adjacent pair of segments is caused to occur at a location at which each likely sentence pause and/or likely speaker change was determined to have occurred. Again, as a result, each of the segments of speech audio should be at least more likely to start and end with portions of sentence pauses, and should be at least more likely to include words spoken by the same speaker(s) throughout. Again, this should serve to increase the likelihood that the entirety of the pronunciation of each letter, of each word, and/or of each sentence is fully contained within a single one of the segments, instead of being split across the divide between two segments, and to increase the likelihood that the manner in which such speech sounds are pronounced throughout each segment should not change. In this way, the accuracy of subsequent processing operations to detect acoustic features, to identify letters, and then to identify whole words, may be improved.

FIGS. 21A, 21B, 21C, 21D, 21E, 21F, 21G, 2111 and 211 , taken together, illustrate an example of using the data segments 3140 into which a speech data set 3100 is divided to perform speech-to-text processing operations in the embodiment of FIGS. 14A-C. FIG. 21A illustrates the use of feature detection and an acoustic model to generate sets of probability distributions that are indicative of relative probabilities of the use of various graphemes, and FIG. 21B illustrates the collection of those probability distribution sets 3143 for use by the control device 2500. FIGS. 21C-D, taken together, illustrate the use of the probability distribution sets 3143 to generate sets of candidate words 3145, and then to generate sets 3146 of candidate n-grams for use by a language model. FIG. 21E provides an overview illustration of using sets of candidate words 3145 and candidate n-gram sets 3146 as input to generate a text data set 3700 representing transcript(s) of the words spoken in speech data set 3100. FIG. 21F illustrates the distribution of a large corpus 3400 representing a language model, along with individual node identifiers 2311, to each one of multiple selected node devices 2300 in preparation for using the language model in a distributed manner. FIGS. 21G-H illustrate aspects of the performance of a distributed beam search within the corpus data set 3400 among the multiple selected node devices 2300 to derive probability sets 3147 indicative of relative probabilities of use of n-grams within the candidate n-gram sets 3146. FIG. 21I illustrates aspects of the collection and use of probability sets 3147 to determine another word to add to a transcript stored as a text data set 3700.

As will be familiar to those skilled in the art, the use of an n-gram language model has become commonplace in speech-to-text processing. Such use of an n-gram language model is often based on an assumption that the next word in a transcript of speech audio is able to be identified with a relatively high degree of accuracy based on what word or words immediately preceded it. It has also been found that the accuracy of the identification of the next word is able to be increased by increasing the quantity of immediately preceding words that are used as the basis for that identification. Unfortunately, as will also be familiar to those skilled in the art, each increase in the quantity of immediately preceding words by a single word can result in an exponential increase in the size of the corpus of n-grams that must be used. As a result, although there have been experimental implementations of speech-to-text processing that have used an n-gram language model supporting up to as many as 10 immediately preceding words, the amount of time, storage and processing resources required often make such an implementation impractical. Therefore, it is more commonplace to employ a quantity 3, 4 or 5 immediately preceding words.

As will shortly be explained, in the embodiment of the distributed processing system 2000 of FIGS. 14A-C, the processing, storage and/or other resources of multiple computing devices may be employed in a cooperative manner to make the use of a higher quantity of immediately preceding words in an n-gram language model in speech-to-text processing significantly more practical.

Turning to FIG. 21A, in executing a division component 2341 of the control routine 2340, processor(s) 2350 of at least one node device 2300 may be caused to divide a data segment 3140 into multiple data frames 3141. In embodiments of the distributed processing system 2000 of FIGS. 14A-C, it may be that multiple data segments 3140 of a speech data set 3100 are distributed among multiple node devices 2300 to enable such processing of data segments 3140 to be performed at least partially in parallel. In so executing the division component 2341, an indication of the length of the speech audio that is to be represented by each data frame 3141 may be caused to be retrieved from the configuration data 2335 and used to control the division of each data segment 3140 into multiple data frames 3141.

Again, at least some acoustic models implemented using neural networks (and/or other technologies) may be designed to accept indications of detected audio features as input, instead of accepting audio data (e.g., the data frames 3141) more directly as input. To accommodate the use of such implementations of an acoustic model, execution of the control routine 2340 may entail execution of a feature detection component 2342 to analyze the portion of speech audio represented by each data frame 3141 to identify instances of each of a pre-selected set of acoustic features. In so doing, processor(s) 2350 may be caused to generate a corresponding feature vector 3142 from each data frame 3141 that is analyzed. Each feature vector 3141 may include indications of each acoustic feature that is identified and when it occurred within the speech audio of the corresponding data frame 3141.

Comparing FIG. 21A to FIG. 18A, it may be that both feature detection and use of an acoustic model may be repeated. Indeed, in comparing FIG. 21A to FIG. 18A, it becomes evident that the very same acoustic model based on a neural network (e.g., the acoustic model neural network 2234 incorporating the CTC output 2235) may be used, again, in some embodiments. However, it should be noted that other embodiments are possible in which different acoustic models based on differing types of neural network may be used, and/or in which different acoustic models based on entirely different technologies may be used. In embodiments in which neural network(s) are used, execution of a configuration component 2344 may cause processor(s) 2350 to again instantiate the same acoustic model neural network 2234 with the CTC output 2235 to implement the same acoustic model. As depicted, in some of such embodiments, it may be that one or more neuromorphic devices 2355 may be used to again implement the acoustic model neural network 2234 in hardware within each of one or more node devices 2300.

Regardless of whether the acoustic models of FIGS. 18A and 21A are identical, there are significant differences in the manner in which they are used in FIGS. 18A and 21A. Unlike the use of an acoustic model in FIG. 18A to perform part of the aforedescribed CTC-based segmentation technique, the acoustic model in FIG. 21A is used to used to perform part of speech-to-text processing operations. More specifically, the acoustic model is now used to generate, from a speech segment represented by a data segment 3140, a probability distribution set 3143. Each of the probability distributions within the set 3143 specifies, for a particular time within the segment, the relative probabilities for each of a pre-selected set of graphemes.

As will be familiar to those skilled in the art, over time, a number of different systems of notation have been devised for describing speech sounds for one or more languages using graphemes. In many of such notation systems, the graphemes may be text characters and/or similar visual symbols (e.g., text characters modified to include various accent markings). In different ones of such notation systems, at least some of the graphemes may each correspond to one or more phonemes, and/or at least some of the graphemes must be used in various combinations that each correspond to one or more phonemes. Thus, in specifying relative probabilities of a pre-selected set of graphemes, each probability distribution may specify the relative probabilities that each of a pre-selected set of speech sounds was uttered at a particular time within a speech segment.

Turning to FIG. 21B, the probability distribution sets 3143 associated with a single speech data set 3100 may be collected from the multiple node devices 2300 in which they were generated, and may be provided to the control device 2500 through the network 2999. Such provision of those multiple probability distribution sets 3143 to the control device 2500 may occur as they are generated, at least partially in parallel, within the multiple node devices 2300. Within the control device 2500, execution of the control routine 2540 may cause processors 2550 of the control device 2500 to organize the probability distribution sets 3143 into temporal order in preparation for being used to identify words for inclusion in a transcript of the contents of the speech audio.

Regardless of whether such a collection and provision of probability distribution sets 3143 via the network 2999 takes place, as also depicted, each of the node devices 2300 of the processing system 2000 (whether engaged in generating probability distribution sets 3143, or not) may also provide the control device 2500 with indications of the availability of their processing, storage and/or other resources. Such indications may be used to augment and/or update resources data 2539.

Turning to FIG. 21C, in executing a candidate word component 2545 of the control routine 2540, processor(s) 2550 of the control device 2500 may be caused to generate sets of one or more candidate words 3145 from each probability distribution set 3143. Then, in executing a candidate n-gram component 2546 of the control routine 2540, processor(s) 2550 of the control device 2500 may be caused to generate corresponding one or more candidate n-gram sets 3146 from the one or more candidate words 3145 that are generated for each probability distribution set 3143.

More specifically, as previously discussed, and turning to FIG. 21D, each speech segment (each of which is represented in storage by a corresponding data segment 3140) may be formed by dividing the speech audio of a speech data set 3100 at midpoints amidst what are determined to be likely sentence pauses and/or likely changes in speakers. As a result, each speech segment may begin with a portion of a sentence pause and/or where there is a change in speakers, and each speech segment may end with a portion of a sentence pause and/or where there is a change in speakers. Each speech segment may then be further divided into frames (each of which is represented in storage by a corresponding data frame 3141), which are kept in temporal order. Thus, as depicted in FIG. 21D, the speech segment (again, represented by a data segment 3140) that corresponds to the depicted probability distribution set 3143 may begin with a first few consecutive speech frames (each of which is represented by a corresponding data frame 3141) in which there may not be any speech sounds, as would be expected within a likely sentence pause. As a result, each of the corresponding first few consecutive probability distributions 3144 (including the earliest thereof) may indicate that a grapheme (e.g., a text character and/or a blank symbol) for an empty space has the highest probability of having occurred within the corresponding speech frame.

Following such consecutive probability distributions 3144 associated with the likely sentence pause at the start of the speech segment, there may then be the first of multiple consecutive probability distributions 3144 that may be associated with the pronunciation of the letters of the first word of a sentence (the transition from probability distributions 3144 associated with a likely sentence pause to probability distributions 3144 that may be associated with pronouncing the first word is marked by vertical dashed line). In executing the candidate word component 2545, processor(s) 2550 of the control device 2500 may, based on those multiple consecutive probability distributions 3144, derive a pre-selected quantity of candidate words 3145 that are each among the most likely to be the first word that was spoken throughout the corresponding multiple consecutive speech frames. The processor(s) 2550 may then be caused by execution of the candidate n-gram component 2546 to convert the set of candidate words 3145 into a candidate n-gram set 3146 a by adding up to a pre-selected quantity of words that were previously identified as the immediately preceding words in what may be a sentence that corresponds to the probability distribution set 3143. However, since each of the candidate words 3145 is preceded by what is deemed to be a likely sentence pause, there may be no such preceding words to be added such that the resulting candidate n-gram set 3146 a contains a set of uni-grams that are each just one of the candidate words 3145.

FIG. 21D also depicts another example set of candidate words 3145 being derived from multiple consecutive probability distributions 3144 at a temporally later location within the same probability distribution set 3143 that may be associated with pronouncing another word at a later time within the same speech segment. Again, in executing the candidate word component 2545, processor(s) 2550 of the control device 2500 may, based on those multiple consecutive probability distributions 3144, derive another pre-selected quantity of candidate words 3145 that are each among the most likely to be the word that was spoken throughout these other corresponding multiple consecutive speech frames. The processor(s) 2550 may then be caused by execution of the candidate n-gram component 2546 to convert this other set of candidate words 3145 into another candidate n-gram set 3146 b by adding up to the pre-selected quantity of words that were previously identified as the immediately preceding words in what may be a sentence that corresponds to the probability distribution set 3143. Unlike the previously discussed set of candidate words 3145, there may be multiple immediately preceding words that were spoken up to the point at which one of the candidate words 3145 within this other set of candidate words 3145. Therefore, the other candidate n-gram set 3146 b may include up to the pre-selected quantity of words.

Turning to FIG. 21E, regardless of whether the n-grams within a candidate n-gram set 3146 generated within the control device 2500 include any immediately preceding words ahead of the candidate words 3145 thereof, in executing a beam search component 2347 of the control routine 2340, processor(s) 2350 may be caused to perform a beam search within the corpus data set 3400 for one or more of the n-grams present within the candidate n-gram set 3146. As will be familiar to those skilled in the art of n-gram language models, each n-gram within an n-gram corpus may be accompanied therein with an indication of the relative frequency of its occurrence and/or its relative probability of occurrence within texts of a particular language (based on the sample texts of the particular language used in generating the n-gram corpus). As each n-gram is found within the corpus data set 3400, an indication of the relative probability of that n-gram occurring may be stored within a probability set 3147 generated for all of the candidate n-grams in the candidate n-gram set 3146.

Following generation of each probability set 3147, execution of a transcript component 2548 of the control routine 2540 may cause processor(s) 2550 of the control device 2500 to, based on the indications of the relative probabilities in the probability set 3147 for each n-gram within the candidate n-gram set 3146, identify a candidate word 3145 among the corresponding set of candidate words 3145 as the word that was most likely the next word to be spoken. The identified most likely spoken word may then be added to the transcript of the speech audio represented as a text data set 3700.

Turning to FIG. 21F, it may be that execution of a coordination component 2549 causes processor(s) 2550 of the control device 2500 to use indications of node devices 2300 with sufficient available processing and/or storage resources as a basis for selecting particular ones of node devices 2300 that are to be employed in performing beam searches of a corpus data set 3400 in a distributed manner. With such selections made, unique node identifiers 2331 may be transmitted to each of the selected node devices 2300 via the network 2999. The node identifiers 2331 may be a continuous series of positive integers of increasing value, starting with 0, and incremented by 1. The processor(s) 2550 of the control device 2500 may also be caused to cooperate with processors 2350 of the node devices 2300 to coordinate communications through the network 2999 to cause the provision of complete copies of the corpus data set 3400 for a pre-selected language from the one or more storage devices 2100 to each of the selected node devices 2300.

Turning to FIG. 21G, in further executing the coordination component 2549, the processor(s) 2550 of the control device 2500 may be caused to provide complete copies of each of the candidate n-gram sets 3146, in temporal order, to all of the selected node devices 2300. Within each of the selected node devices 2300, execution of the beam search component 2347 of the control routine 2340 may cause the processor(s) 2350 thereof to perform a beam search within the corpus data set 3400 for one or more of the n-grams present within the candidate n-gram set 3146. As will be familiar to those skilled in the art of n-gram language models, each n-gram within an n-gram corpus may be accompanied therein with an indication of the relative frequency of its occurrence and/or its relative probability of occurrence within texts of a particular language (based on the sample texts of the particular language used in generating the n-gram corpus).

Referring to FIG. 21I1, in addition to FIG. 21G, it should be noted that each of the selected node devices 2300 is caused to perform a beam search for different one(s) of the n-grams within the candidate n-gram set 3146, such that no two of the selected node devices 2300 are caused to perform a beam search for the same n-gram. In some embodiments, this may be effected through the use of modulo calculations in which, within each of the selected node devices 2300, the numerical designation of the position occupied by each n-gram within the candidate n-gram set 3146 is divided by the quantity of the selected node devices 2300 to derive a modulo value for each n-gram within the candidate n-gram set 3146. The modulo value calculated for each n-gram is then compared to the unique node identifier 2331 that was earlier assigned to the selected node device 2300. The n-gram(s) that are searched for within each of the selected node devices 2300 are the one(s) for which the modulo value matches the unique node identifier 2331 for that node device 2300.

Thus, as depicted (in the deliberately simplified example in FIG. 21H in which there are only three selected node devices 2300), within the selected node device 2300 that has been assigned the “0” node identifier 2331, the n-grams at the “0th” and “3rd” positions within the candidate n-gram set 3146 are searched for within the corpus data set 3400 stored therein. Correspondingly, within the selected node device 2300 that has been assigned the “1” node identifier 2331, the n-grams at the “1st” and “4th” positions within the candidate n-gram set 3146 are searched for within the corpus data set 3400 stored therein. Also correspondingly, within the selected node device 2300 that has been assigned the “2” node identifier 2331, the n-gram at the “2nd” position within the candidate n-gram set 3146 is searched for within the corpus data set 3400 stored therein. In this way, a relatively even distribution of n-grams to be searched for within the corpus data set 3400 across the multiple selected node devices 2300 is achieved with relatively minimal communication across the network 2999.

Also, by providing each of the selected node devices 2300 with a complete copy of the entire corpus data set 3400, all processing operations for the beam search for each n-gram are performed entirely within a single node device 2300 without need for communications with any other device through the network 2999. This entirely eliminates the need for network communications among the selected node devices 2300 to carry out any of the beam searches, thereby reducing consumption of network bandwidth and eliminating the expenditure of time that would occur while such communications take place.

Further, such distribution of beam searches among multiple computing devices enables the corpus data set 3400 to be of considerably larger size versus the maximum size that would be practical and/or possible were just a single computing device used. As will be familiar to those skilled in the art, the ability to more efficiently perform a greater quantity of beam searches in less time, thereby enabling the use of a larger corpus, may advantageously permit a corpus to include more lower frequency n-grams (i.e., n-grams that have a relatively low probability of occurring within texts of a particular language) and/or to include n-grams with a greater quantity of words per n-gram.

Focusing again more specifically on FIG. 21G, within each of the selected node devices 2300, as each n-gram is found within the corpus data set 3400, an indication of the relative probability of that n-gram occurring may be stored within a probability set 3147 generated for all of the n-grams for which a beam search is performed within that selected node device 2300. In some embodiments, where a particular n-gram is not found within the corpus data set 3400, an indication of default value for the relative probability of the occurrence of an “unknown” n-gram may be stored within the probability set 3147.

Turning to FIG. 21I, each of the probability sets 3147 may be provided to the control device 2500 through the network 2999 as they are generated, at least partially in parallel, within multiple node devices 2300. Within the control device 2500, execution of a transcript component 2548 may cause processor(s) 2550 of the control device 2500 to, based on the indications of the relative probabilities retrieved for each n-gram within the candidate n-gram set 3146, identify the word that was most likely spoken. The identified most likely spoken word may then be added to the transcript of the speech audio. Upon completion of the generation of the transcript, the control device 2500 may provide it to the one or more storage devices 2100 to be persistently stored therein as a text data set 3700.

FIGS. 22A, 22B, 22C, 22D, 22E and 22F, taken together, illustrate an example of using the data segments 3140 into which a speech data set 3100 is divided to perform speech-to-text processing operations in the embodiment of FIGS. 14D-F. FIG. 22A-B, taken together, illustrate aspects of the manner in which an example of single-threaded pre-processing and initial speech-to-text processing operations may be combined with multi-threaded subsequent speech-to-text processing operations to efficiently utilize processing, storage and other resources within each node device 2300 to perform speech-to-text conversion on multiple speech data sets 3100 in parallel. FIG. 22C illustrates the use of feature detection and an acoustic model within a single thread 2454 s to generate sets of probability distributions as part of the initial single-threaded speech-to-text processing operations. FIG. 22D illustrates the use of a buffer queue 2460 to distribute the probability distribution sets generated in FIG. 22C among multiple threads 2454 p of a thread pool 2450 for the performances of beam searching as part of the subsequent multi-threaded speech-to-text processing operations. FIG. 22E illustrates the multi-threaded use of use of the probability distribution sets 3143 to generate sets of candidate words 3145, and then to generate sets 3146 of candidate n-grams for use by a language model across the multiple threads 2454 p of the thread pool 2450. FIG. 22F provides an overview illustration of the multi-threaded use of sets of candidate n-gram sets 3146 as inputs to parallel performances of beam searches, and sets of candidate words 3145 as additional inputs to generating a text data set 3700 representing a transcript of the words spoken in the corresponding speech data set 3100.

Again, the use of an n-gram language model has become commonplace in speech-to-text processing due to having been found to increase the accuracy of the identification of spoken words. However, again, the use of an n-gram language model has also been found to consume considerable resources, with such consumption of resources increasing exponentially as the size of the n-grams increases by even one more word. As will shortly be explained, in the embodiment of the distributed processing system 2000 of FIGS. 14D-F, the processing, storage and/or other resources of multiple threads within a single computing device may be employed to better enable the practical use of n-grams having larger quantities of words.

Again, the operation in speech-to-text conversion at which so much of processing, storage and/or other resources are consumed has been found to the beam searches that are performed on an n-gram corpus that implements a language model. And again, arranging for beam searches to be performed at least partially in parallel has been found to be an efficient approach to addressing the bottleneck that often results.

Turning to FIGS. 22A-B, in contrast to the approach described just above of distributing parallel performances of beam searches associated with a single speech data set 3100 across multiple node devices 2300 in the distributed processing system 2000 of FIGS. 14A-C, what will now be described in greater detail is an approach of distributing parallel performances of beam searches associated with a speech data set 3100 across multiple threads 2454 p of a thread pool 2450 within a single node device 2300 in the distributed processing system 2000 of FIGS. 14D-F.

More specifically, for a single speech data set 3100, the pre-processing operations of the control routine 2310, and a subset of the speech-to-text operations of the control routine 2340 that precede operations associated with using a language model (as implemented with the corpus data set 3400) may be performed entirely within a single thread 2454 s within a single node device 2300. Some degree of parallel performance of the pause detection pre-processing operations within the single thread 2454 s may be implemented through use of the neuromorphic device(s) 2355 (in embodiments in which the node device 2300 include the neuromorphic device(s) 2355) to obviate the need to implement an acoustic model based on a neural network in software for CTC-based pause detection. However, the use of a thread pool 2450 of multiple threads 2454 p may be reserved for speech-to-text processing operations that are associated with using a language model.

In this way, most, if not all, pre-processing operations and speech-to-text processing operations for a single speech data set 3100 may be performed entirely within a single node device 2300, thereby eliminating much of the use of network communications associated with the distributed processing system 2000 of FIGS. 14A-C. Thus, for each speech data set 3100, the need for communications among multiple devices through the network 2999 is obviated as a mechanism to achieve parallel performances of beam searches of the corpus data set 3400 as part of generating a text data set 3700 representing what was said in a speech represented by a speech data set 3100. Instead, as shortly will be explained in greater detail, a buffer queue 2460 is used to distribute individual probability distribution sets 3143 generated in the single thread 2454 s of the preceding pre-processing and processing operations among the multiple threads 2454 p of a thread pool 2450 instantiated within the same single node device 2300. As each thread 2454 p of a thread pool 2450 is used in generating a portion of a text data set 3700 from the probability distribution set 3143 provided to it as input, those portions of the text data set 3700 are assembled in temporal order to generate the text data set 3700 within the same single node device 2300. Also in this way, depending on the overall quantity of threads 2454 that are able to be supported within each node device 2300 of the distributed processing system 2000 of FIGS. 14D-F, it may be possible for at least a subset of the node devices 2300 to each support the performance of pre-processing and speech-to-text processing operations by which multiple text data sets 3700 may be generated from multiple corresponding speech data sets 3100 in parallel.

More specifically, and referring more specifically to FIG. 22B, it may be that at least the depicted node device 2300 xy is able to support the use of a sufficient quantity of threads 2454 as to enable two thread pools 2450 x and 2450 y to be instantiated that each include a sufficient quantity of threads 2454 p as to enable a sufficient quantity of parallel performances of beam searches of the corpus data set 3400 as to enable the parallel generation of both of the depicted text data sets 3700 x and 3700 y from the depicted speech data sets 3100 x and 3100 y, respectively. As also depicted, another node device 2300 z may be able to support the use of a sufficient quantity of threads 2454 as to enable at least one other thread pool 2450 z to be instantiated to similarly enable the generation of at least one other text data set 3700 z from a corresponding at least one other speech data set 3100 z.

FIG. 22C depicts some of the speech-to-text processing operations that are performed in a single thread 2454 s that precedes the parallel use of a language model in a thread pool 2450 of multiple threads 2454 p. In this single-threaded execution environment, each data segment 3140 of a speech data set 3100 is used as an input to generating a corresponding probability distribution set 3143. More specifically, in executing the division component 2341 of the control routine 2340, processor(s) 2350 of a single one of the node devices 2300 may be caused to divide each data segment 3140 of multiple data segments of a speech data set 3100 into multiple data frames 3141. In so executing the division component 2341, an indication of the length of the speech audio that is to be represented by each data frame 3141 may be caused to be retrieved from the configuration data 2335 and used to control the division of each data segment 3140 into multiple data frames 3141.

Again, at least some acoustic models implemented using neural networks (and/or other technologies) may be designed to accept indications of detected audio features as input, instead of accepting audio data (e.g., the data frames 3141) more directly as input. To accommodate the use of such implementations of an acoustic model, execution of the control routine 2340 may entail execution of a feature detection component 2342 to analyze the portion of speech audio represented by each data frame 3141 to identify instances of each of a pre-selected set of acoustic features. In so doing, processor(s) 2350 may be caused to generate a corresponding feature vector 3142 from each data frame 3141 that is analyzed. Each feature vector 3141 may include indications of each acoustic feature that is identified and when it occurred within the speech audio of the corresponding data frame 3141.

Comparing FIG. 22C to FIG. 18A, it becomes evident that the very same acoustic model based on a neural network (e.g., the acoustic model neural network 2234 incorporating the CTC output 2235) may be used in both the CTC-based pause detection, and generating probability distribution sets 3143 as part of using acoustic features in beginning the identification of words spoken. However, it should again be noted that other embodiments are possible in which different acoustic models based on differing types of neural network may be used, and/or in which different acoustic models based on entirely different technologies may be used. In embodiments in which neural network(s) are used, execution of a configuration component 2344 may cause processor(s) 2350 to again instantiate the same acoustic model neural network 2234 with the CTC output 2235 to implement the same acoustic model. As depicted, in some of such embodiments, it may be that one or more neuromorphic devices 2355 may be used to again implement the acoustic model neural network 2234 in hardware within each of one or more node devices 2300.

FIG. 22D depicts aspects of the manner in which a buffer queue 2460 is employed in distributing, among the multiple threads 2454 p of the depicted thread pool 2450, the probability distribution sets 3143 that have been generated within a single thread 2454 s, as just described in reference to FIG. 22C. The buffer queue 2460 may be operated as a FIFO buffer. Thus, as probability distribution sets 3143 are being generated as an output of the acoustic model neural network 2234 within the single thread 2454 s, each one of those probability distribution sets 3143 may be stored within one of the data buffers 2466 to become available to the threads 2454 p of the thread pool 2450. As the speech-to-text processing operations using one of the probability distribution sets 3143 are completed within each thread 2454 p so as to allow that thread 2454 p to become available for beginning such processing with another probability distribution set 3143, that thread 2454 p may be provided with the next probability distribution set 3143 in the order in which the probability distribution sets 3143 were stored within the buffer queue 2460.

It should be noted that, in some embodiments, the generation of probability distribution sets 3143 from data segments 314 may be done in batches as part of an approach to make better use of opportunities for parallel performances of various operations enabled by the thread pool. Thus, a batch of data segments 3140 may be divided into data frames 3141 from which corresponding feature vectors 3142 may be generated, which may be provided as input to the acoustic model neural network 2234 to generate a corresponding batch of probability distribution sets 3143. In such embodiments, it may then be that a batch of multiple ones of the probability distribution sets 3143 corresponding to a batch of multiple ones of the data segments 3140 may be stored together within a single data buffer 2466 of the buffer queue 2460, thereby resulting in the batch of probability distribution sets 3143 corresponding to a batch of data segments 3140 being provided as an input to a single one of the threads 2454 p of the thread pool 2450, instead of a single probability distribution set 3143 corresponding to a single data segment 3140. Alternatively, in spite of the generation of batches of probability distribution sets 3143 from corresponding batches of data segments 3140, it may be that just a single probability distribution set 3143 corresponding to just a single data segment 3140 may be stored within each of the data buffers 2466.

As previously discussed, in executing the resource routine 2440, processor(s) 2350 of the single node device 2300 may instantiate the buffer queue 2460 in addition to instantiating the single thread 2454 s in which the probability distribution sets 3143 are generated, and the thread pool 2450 of multiple threads 2454 p in which the probability distribution sets 3143 are used. Although not specifically depicted, in some embodiments, it may be that the resource routine 2440 is executed within the single thread 2454 s such that the use of processing and/or storage resources for instantiation, maintenance and/or control of at least the buffer queue 2460 occurs within the single thread 2454 s. Alternatively, it may be that the resource routine 2440 is executed within an entirely separate thread 2454 (not specifically shown) such that the use of processing and/or storage resources for instantiation, maintenance and/or control of the buffer queue 2460 and/or of the threads 2454 s and/or 2454 p occurs within that separate thread 2454.

In some embodiments, the quantity of threads 2454 p allocated to the thread pool 2450 and/or the quantity of data buffers 2466 that are allocated to the buffer queue 2460 may be predetermined and fixed quantities. Indeed, it may be that such quantities are specified in the configuration data 2335, and may be retrieved therefrom as part of instantiated a thread pool 2450 and/or a buffer queue 2460. In other embodiments, one or both of these quantities may be dynamically adjustable based on various factors that may be monitored over time, including and not limited to, a rate at which a text data set 3700 is being generated from a speech data set 3100 (e.g., is this rate keeping up with speech of a speech data set 3100 that is currently being spoken in real time), a quantity of available processing resources (e.g., a maximum quantity of threads that processor(s) 2350 of a node device 2300 are currently able to support) and/or of available storage resources (e.g., an amount of available storage space that is able to be provided to sufficiently support the various operations being performed within the threads 2454 s and 2454 p for each speech data set 3100), etc. More specifically, where the processing and/or storage resources of a node device 2300 are not being fully utilized, it may be that additional threads 2454 p may be added to existing thread pool(s) 2450 and/or it may be that additional data buffers 2466 may be added to existing buffer queue(s) 2460. Still further, the quantity of threads 2454 p in a thread pool 2450 and/or the quantity of data buffers 2466 in a buffer queue 2460 may be adjusted based on such characteristics of a particular speech data set 3100 as a current audio noise level 3112 (that may be determined as discussed in reference to FIG. 17A), based on what language(s) are spoken in the speech represented by a particular speech data set 3100, and/or the current quantity of speakers that are determined to have spoken within the speech represented by a particular speech data set 3100.

As previously discussed, each data segment 3140 may include an indication of a range of time associated with the speech segment that it represents within the speech that is represented by a speech data set 3100. As a probability distribution set 3143 is generated from each data segment 3140, a time stamp may be assigned to each probability distribution of the relative probabilities of various graphemes and/or phonemes that may have occurred at the time indicated by that time stamp. Thus, each probability distribution set 3143 may include (or be otherwise associated with) a range of time that it covers out of the larger range of time during which the speech represented by the speech data set 3100 was spoken. Such indications of time within (or otherwise associated with) each probability distribution set 3143 may be used in causing the probability distribution sets 3143 to be loaded into the data buffers 2466 of the buffer queue 2460 in temporal order. In this way, advantage may be taken of the FIFO manner of operation of the buffer queue 2460 to ensure that the probability distribution sets 3143 are then distributed among the threads 2454 p of the thread pool 2450 in the same temporal order.

In this way, there is at least an increased likelihood that, across the threads 2454 p of the thread pool 2450, the portions of the text data 3700 that are generated as outputs of the speech-to-text operations performed within each of those threads 2454 p will at least have a tendency to be output in temporal order. However, with separate instances of speech-to-text processing operations being performed entirely independently of each other, and in parallel, it is entirely possible that there may be portions of the text data set 3700 that are generated out of temporal order. To address this, each of the portions of the text data 3700 that are so generated may include (or be otherwise associated with) time stamps providing indications of the range of time covered by each of those portions, and such time stamps may then be used to ensure that those portions of the text data set 3700 are assembled in temporal order to correctly form the transcript within the text data set 3700.

FIG. 22E depicts some of the speech-to-text processing operations associated with using a language mode, and that are performed as multiple instances thereof across the multiple threads 2454 p of the thread pool 2450. Within each of the threads 2454 p of this multi-threaded execution environment, each data segment 3140 of a speech data set 3100 is used as an input to generate a corresponding probability distribution set 3143. More specifically, within each of the threads 2454 p, in executing a candidate word component 2345 of the control routine 2340, processor(s) 2350 of the node device 2300 may be caused to generate sets of one or more candidate words 3145 from a probability distribution set 3143. Then, in executing a candidate n-gram component 2346 of the control routine 2340, processor(s) 2350 of the node device 2300 may be caused to generate corresponding one or more candidate n-gram sets 3146 from the one or more candidate words 3145 that are generated for the probability distribution set 3143.

Turning to FIG. 22F, in preparation for the parallel performances of beam searches, each of the threads 2454 p may be provided with a copy of the corpus data set 3400, as depicted in FIG. 22A. Alternatively, each of the node devices 2300 may be provide with a copy of the corpus data set 3400 to which access may be shared among the multiple threads 2454 p of a single thread pool 2450, or to which access may be shared among the multiple threads 2454 p of more than one thread pool 2450. Again, the corpus data set 3400 may implement a language model as a corpus of n-grams. Within each thread 2454 p, in executing a beam search component 2347 of the control routine 2340, processor(s) 2350 of the node device 2300 may be caused to perform a beam search within the corpus data set 3400 for one or more of the n-grams present within the candidate n-gram set 3146. Again, as will be familiar to those skilled in the art of n-gram language models, each n-gram within an n-gram corpus may be accompanied therein with an indication of the relative frequency of its occurrence and/or its relative probability of occurrence within texts of a particular language. As each n-gram is found within the corpus data set 3400, an indication of the relative probability of that n-gram occurring may be stored within a probability set 3147 generated for all of the candidate n-grams in the candidate n-gram set 3146 earlier generated from a single probability distribution set 3143.

Following generation of each probability set 3147, execution of a transcript component 2348 of the control routine 2340 may cause processor(s) 2350 of the node device 2300 to, based on the indications of the relative probabilities in the probability set 3147 for each n-gram within the candidate n-gram set 3146, identify a candidate word 3145 among each corresponding set of candidate words 3145 as a next word most likely spoken. The identified most likely spoken words associated with the range of time covered by the candidate n-gram set 3146 (which corresponds to one of the probability distribution sets 3143) may then be added to the transcript of the speech audio represented as a text data set 3700.

FIGS. 23A, 23B and 23C illustrate examples of additional improvements that may be incorporated to the performance of various ones of the speech-to-text operations described above. FIG. 23A illustrates aspects of using the same acoustic model in the aforedescribed CTC segmentation technique and in the aforedescribed initial speech-to-text processing operations. FIG. 23B illustrates aspects of the addition of dynamic per-word assignment of relative weighting to the use of an acoustic model or a language model in identifying spoken words. FIG. 23C illustrates aspects of selective concatenation of segments of audio speech to effect the formation of longer transcripts to improve the results of subsequent post-processing text analysis operations.

Turning to FIG. 23A, as previously discussed, due to the use of an acoustic model in the aforedescribed CTC segmentation technique of FIGS. 18A-B, and due to use of an acoustic model in the aforedescribed initial speech-to-text processing operations of FIGS. 21A-D, it may be that, in some embodiments, the very same acoustic model is used in both of these pre-processing and speech-to-text processing operations. In such embodiments, and where the processing system 2000 includes multiple node devices 2300 in which the single acoustic model may be used to perform of those functions, it may be that the single acoustic model is instantiated within those multiple node devices 2300 in preparation for the performing the CTC segmentation technique, and then allowed to remain instantiated so as to already be in place within the storage of those multiple node devices 2300 for subsequent use in the aforedescribed initial speech-to-text processing operations. In this way, advantage may be taken of an opportunity to avoid the consumption of time, network resources and/or processing resources to instantiate the same acoustic model, twice.

Thus, by way of example, and as specifically depicted in FIG. 23A, in such embodiments where the acoustic model neural network 2234 may be implemented using the neuromorphic device(s) 2355 incorporated into each of such node devices 2300, it may be that execution of the configuration component 2314 (as described earlier in connection with FIG. 18A) to cause instantiation of the neuromorphic device(s) 2355 to implement the acoustic model neural network 2234 enables the avoidance of subsequent execution of the configuration component 2344 (as described earlier in connection with FIG. 21A) to do so, again.

Turning to FIG. 23B, as previously discussed, it has become commonplace to employ a two-stage combination of an acoustic model and a language model in which the acoustic model is typically relied upon to perform a first pass at identifying words that are likely to be the ones that were spoken, and the language model is typically relied upon to perform the next and final pass by refining the identification of such spoken words such that the words identified by the language model are the ones from which a transcript is generated. However, and as also previously discussed, the reduced error rate achieved by such a two-stage combination is still widely seen as being too high. Again, a possible reason for being still too high is that a good language model tends to resist identifying words that are actually spoken where those spoken words include mistakes in vocabulary and/or syntax.

To improve upon the error rate of such a typical two-stage use of a combination of an acoustic model and a language model, in some embodiments, the transcript component 2548 may incorporate additional functionality to dynamically vary the relative weighting assigned to each of the acoustic model and the language model for each word to be identified based on the degree of uncertainty in the per-grapheme probability distributions output by the acoustic model for each word. Thus, in addition to being provided with the probability set 3147 and corresponding candidate words 3145 associated with a segment of speech audio as inputs, the transcript component 2548 may additionally receive the corresponding probability distribution set 3143 that includes the corresponding probability distributions for graphemes associated with the same segment of speech audio.

In executing the transcript component 2548, core(s) 2551 of processor(s) 2550 of the control device 2500 may be caused to use the probability distributions of graphemes that are output by the acoustic model for the pronunciation of a single word spoken within the segment to derive a measure of the degree of uncertainty for each of those probability distributions. Such a degree of uncertainty may be based on degree of a perplexity, degree of entropy, or other statistical measures of those probability distributions. Again, such a degree of uncertainty may serve as an indication of the degree to which a probability distribution for a grapheme presents an indefinite indication of which speech sound was uttered during a corresponding portion of the segment of speech audio.

A probability distribution for graphemes that provides an uncertain indication of what speech sound was uttered may be one in which the degree of probability for the grapheme indicated as being the most probable is not significantly higher than the degree of probability for the grapheme indicated as being the second most probable. More specifically, where the difference between these two degrees of probability is less than a pre-determined threshold difference in probabilities, the probability distribution may be deemed to provide an indication that the second most probable grapheme is almost as likely to describe a speech sound that was uttered as the speech sound described by the most probable grapheme such that it is deemed to be uncertain as to which of these two speech sounds is the one that was uttered.

In this way, the probability distribution may be said to provide an ambiguous indication of what speech sound was uttered. In some embodiments, the degree of uncertainty used to control which model is to be relied upon to identify a single word may be derived from measures of such a difference in probabilities associated with the most probable grapheme and the second most probable grapheme within each probability distribution associated with the single word. These differences in probabilities may be averaged or otherwise aggregated to derive a single value indicative of the degree of uncertainty, which may then be compared to a threshold degree of uncertainty specified in the configuration data 2335. Where the degree of uncertainty is less than the threshold, greater weight may be assigned to the identification of the single word using the acoustic model, and where the degree of uncertainty is greater than the threshold, greater weight may be assigned to the identification of the single word using the language model.

In other embodiments, the degree of uncertainty used to control which model is to be relied upon to identify a single word may be derived as an aggregate degree of perplexity or entropy. Stated differently, the degree of uncertainty may be based on calculations of the degree of entropy or degree of perplexity (which may be derived from a degree of entropy) of each probability distribution associated with the single word may be calculated and aggregated to derive a degree of uncertainty. In such embodiments, the aggregated degree of uncertainty may be compared to a threshold degree of uncertainty specified in the configuration data 2335. Again, where the degree of uncertainty is less than the threshold, greater weight may be assigned to the identification of the single word using the acoustic model, and where the degree of uncertainty is greater than the threshold, greater weight may be assigned to the identification of the single word using the language model.

As previously discussed, in some embodiments, both of the acoustic model and the language model may always be utilized in combination for each spoken word, regardless of whether the dynamic per-word determination is made to give greater weight to relying more on the acoustic model or the language model to identify a word. Thus, the beam searches associated with the execution of the beam search component 2347 to use the language model (where the language model is based on an n-gram corpus) may always be performed regardless of such dynamic per-word assignment of relative weighting. This may be the case where an output of the language model is employed as an input to the dynamic per-word relative weighting assigned to the acoustic and language models in addition to degree of uncertainty for the probability distributions for the corresponding graphemes.

Alternatively, in other embodiments, it may be that the language model is not used to provide any input to the dynamic per-word relative weighting. In such other embodiments, such a situation may provide the opportunity to entirely refrain from consuming processing and or storage resources to perform beam searches associated with using the language model to identify a particular word if the results of the dynamic per-word relative weighting are such that the identification of the word that would be provided by the language model will not be used. In this way, use of the language model may be made contingent on such dynamic per-word relative weighting.

As will be familiar to those skilled in the art, speech recognition in the human brain involves using a combination of detecting and recognizing speech sounds as received by the ears, and recognizing portions of language based on language rules. It has been observed that, where speech sounds are able to be clearly heard, speech recognition in the human brain tends to rely more heavily on those sounds to determine what was said. However, such reliance on speech sounds as received by the human ears may become insufficient where acoustic conditions are such that some speech sounds are masked enough to not be heard such that there are noticeable gaps in the speech sounds as received. It has been observed that, where at least some speech sounds are less clearly heard, speech recognition in the human brain tends to rely more heavily on language rules to determine what was said, thereby effectively “filling in the gaps” among the speech sounds that were able to be heard. To put this more simply, it has been observed that the human brain will take advantage of opportunities to not expend the resources needed to use language rules for such purposes when it is not necessary.

The use of degrees of uncertainty to select between the acoustic and language models in identifying each word, as just described, effectively achieves a similar result. Where acoustic conditions are sufficiently good as to enable spoken words to be captured clearly, the probability distributions output by the acoustic model are more likely to demonstrate greater certainty in being able to identify words through use of the acoustic model, alone. However, where acoustic conditions are sufficiently poor as to degrade the ability to capture spoken words clearly, the probability distributions output by the acoustic model are more likely to demonstrate greater uncertainty in being able to identify words through use of the acoustic model alone, thereby inviting the use of the language model to identify words. Thus, such an evaluation of at least the degree of uncertainty of the probability distributions output by the acoustic model provide an indirect path for taking acoustic conditions into account in dynamically determining how each spoken word is ultimately identified.

However, as also depicted in FIG. 23B, alternative embodiments are possible in which the acoustic conditions under which speech sounds are captured may be more directly taken into account. Specifically, it may be that the indications of audio noise level 2235 that are determined and stored as part of performing the APA segmentation technique (as described earlier in connection with FIG. 17A) may be used as another input to the transcript component 2548 in determining whether to use the acoustic model or the language model in selecting each word for inclusion in a transcript. By way of example, while it may be that the degree of uncertainty demonstrated in the probability distributions from the acoustic model may be a primary factor in making such selections, an indication in the audio noise level 2235 of there being audio noise at a level exceeding a pre-determined upper limit may trigger the use of the language model, regardless of the degree of uncertainty demonstrated in the probability distributions from the acoustic model.

Turning to FIG. 23C, from experimentation and observation, it has been found that, generally, many forms of automated text analyses are able to be more successfully used with longer transcripts. Again, it has been found that shorter transcripts tend to cause an overemphasis on words with greater frequencies of use in a language, with the result that analyses to derive topics and/or other insights concerning the text of a transcript tend to produce less useful results.

As an approach to counteracting this effect, in some embodiments, all of the text derived from a single piece of speech audio may be maintained and treated (at least for purposes of performing text analyses) as a single transcript. More specifically, the text generated from speech-to-text processing of a single speech data set 3100 may be organized within the text data set 3700 as a single transcript. However, as also previously discussed, a single transcript encompassing speech audio that is especially long and/or that includes multiple conversations and/or verbal presentations may also beget less useful results when text analyses are performed thereon.

Thus, in some embodiments, rules concerning lengths of transcripts, frequencies of words, and/or acoustic features such as relatively lengthy pauses may be used to bring about the generation of lengths and/or quantities of transcripts for each piece of speech audio that are more amenable to providing useful results from automated text analyses. More specifically, a set of such rules may be used to cause the selective concatenation of the text of consecutive sets of segments of speech audio stored as a single speech data set 3100 to form multiple transcripts that may be stored together as a set of transcripts within a single corresponding text data set 3700 (or as a set of transcripts that are each stored as a separate text data set 3700). Such a text data set 3700 (or such a multitude of text data sets 3700) may include indications of the relative temporal order of the multiple transcripts to preserve at least that contextual aspect.

Indications of such rules and/or thresholds therefore may be maintained as part of the configuration data 2335. Among such thresholds may be a minimum and/or maximum threshold for the size of a transcript, which may be expressed in terms of quantities of words and/or lengths of time periods. In some of such embodiments, it may be that text associated with segments of speech audio may be automatically combined to form transcripts that have a length that meets such word count and/or time thresholds.

Alternatively or additionally, the configuration data 2335 may specify a minimum threshold quantity of words in a transcript that are required to have a frequency of occurrence in a language that falls below a specified maximum threshold. In some of such embodiments, it may be that text associated with segments of speech audio may be combined to form transcripts in which the combination of words includes such a requisite quantity of such lower frequency words. In so doing, the storage, within a corpus data set 3400, of uni-grams that are each correlated to an indication of frequency of use may be relied upon as a source of such indications of frequency.

Also alternatively or additionally, the configuration data 2335 may specify a minimum threshold length of time for a pause between speech sounds that may be greater than the minimum threshold length for a likely sentence pause such that it may be deemed a likely pause between conversations and/or verbal presentations where a change of subject may be more likely to occur. In some of such embodiments, occurrences of such longer pauses may be used as breakpoints at which text may be divided to define multiple transcripts. There may still be an enforcement of minimum and/or maximum thresholds as a default to address situations in which too few or too many of such longer pauses are found to occur.

FIGS. 24A, 24B, 24C, 24D, 24E, 24F and 24G, taken together, illustrate, in greater detail, aspects of the generation and/or augmentation of an n-gram corpus implementing an n-gram language model. More specifically, FIGS. 24A-G present, in greater detail, aspects of the generation and/or augmentation of a corpus data set 3400 based on the contents of a text data set 3700. FIG. 24A illustrates aspects of the distribution of portions of a selected text data set 3700 among multiple node devices 2300 in preparation for the generation of n-grams therefrom. FIG. 24B illustrates aspects of the generation of a portion of an n-gram corpus from each of the portions of the selected text data set 3700. FIGS. 24C-D illustrate aspects of the collection and combining of the generated portions of n-gram corpus to either form an entirely new corpus data set 3400, or augment an existing corpus data set 3400. FIG. 24E illustrates aspects of the distribution of portions of the new or augmented corpus data set 3400 among multiple node devices 2300 in preparation for the deduplication of n-grams therein. FIGS. 24F-G illustrate aspects of the collection and re-combining of the deduplicated portions of the corpus data set 3400, and the calculation and/or re-calculation of relative frequencies and/or probabilities of occurrence of each of the n-grams therein.

Turning to FIG. 24A, within the control device 2500, execution of the control routine 2510 may cause processor(s) 2550 thereof to select particular ones of the node devices 2300 for use in performing operations to generate or augment an n-gram corpus from a selected text data set 3700. The text data set 3700 may have been previously generated as a transcript from speech audio, and/or the text data set 3700 may have been generated from any of a variety of other sources.

Following the selection of node devices 2300, in executing a coordination component 2519 of the control routine 2510, processor(s) 2550 of the control device 2500 may be caused to cooperate with processors 2350 of the node devices 2300 to coordinate communications through the network 2999 to cause the provision of a different portion 3710 of the text data set 3700 to each of the selected node devices 2300. In this way the selected node devices 2300 are prepared for use in generating n-grams from the selected text data set 3700 in a distributed manner.

Turning to FIG. 24B, in some embodiments, the processor(s) 2350 of one or more of the selected node devices 2300 may be capable of supporting multiple execution threads 2352 by which multiple different executable routines and/or multiple instances of an executable routine may be executed at least partially in parallel. Within each of such selected node devices 2300, the received text data portion 3710 may be divided into multiple text data sub-portions 3711 that are distributed among multiple execution threads 2352 therein. Within each such execution thread 2352, execution of an n-gram component 2317 of an instance of the control routine 2310 may cause a core of a processor 2350 to parse through the text within the corresponding text data sub-portion 3711 to generate n-grams therefrom.

In so doing, within each execution thread 2352, it may be that an n-gram buffer 2237 is instantiated to temporarily assemble and store sets of the generated n-grams until the n-gram buffer 2237 has been filled to at least a predetermined degree, whereupon the contents of the n-gram buffer 2237 may be added to a corresponding corpus data sub-portion 3411. In some embodiments, the n-gram buffer 2237 may be implemented as a hash map in which a two-dimensional (2D) array is defined wherein each row thereof is to store an n-gram generated from the corresponding text-data sub-portion 3711, along with a count of instances of that n-gram that have been generated. As each n-gram is generated from the text of the text data sub-portion 3711, a hash value may be taken of that n-gram, and that hash value may become the index value used to specify which row within the n-gram buffer 2237 is the row in which that n-gram is to be stored, and in which the count for that n-gram is to be incremented to reflect the generation of an instance thereof. Each time the contents of the n-gram buffer 2237 are added to the corresponding corpus data sub-portion 3411, the counts for all of the rows therein may be reset to indicate a quantity of 0 instances.

Such use of an n-gram buffer 2237 implemented as such a hash map may aid in reducing data storage requirements for each execution thread 2352 and/or for each corpus data sub-portion by enabling some degree of deduplication of n-grams to be performed. More specifically, such use of hash values as index values for rows within such an implementation of a hash table enables multiple instances of the same n-gram to be relatively quickly and efficiently identified so that just a single row of storage space within the n-gram buffer 2237 is occupied for those multiple instances, instead of allowing each of those instances to occupy a separate storage location within a data structure, even temporarily.

Such use of distributed processing across multiple node devices 2300 and/or across multiple execution threads 2352 within each node device 2300, and such use of hash maps in performing at least an initial deduplication of n-grams, may serve to enable relatively large n-gram corpuses to be generated and used in the performance of speech-to-text processing. As a result, supporting a larger than commonplace n-gram corpus that includes larger n-grams that include relatively large quantities of words (e.g., greater than the more commonplace quantities of 5 words or less) becomes practical. Alternatively or additionally, supporting a larger than commonplace n-gram corpus that includes highly infrequently used n-grams (e.g., n-grams that include names of specific people and/or places such that they may be found in just one of thousands of text documents) also becomes practical. As those skilled in the art will readily recognize, it is commonplace practice to allow only n-grams that occur in texts with a frequency above a predetermined minimum threshold frequency to be included in an n-gram corpus in an effort to limit the overall size thereof. The ability to support a larger n-gram corpus may render such a restriction unnecessary, thereby increasing the accuracy that is able to be achieved in performing to speech-to-text processing.

Within each of the selected node devices 2300, following the use of the entirety of the text data sub-portion 3711 in generating n-grams, the multiple execution threads 2352 may be caused to cooperate to assemble the multiple corpus data sub-portions 3411 therein to form a single corresponding corpus data portion 3410.

Turning to FIG. 24C, within the control device 2500, further execution of the coordination component 2519 may cause processor(s) 2550 of the control device 2500 to cooperate with processors 2350 of the node devices 2300 to coordinate communications through the network 2999 to cause the corpus data portions 3410 generated within each of the selected node devices to be provided to the one or more storage devices 2100. In so doing, the multiple corpus data portions 3410 may be combined to form a new corpus data set 3400, or may be combined and added to an existing corpus data set 3400.

Turning to FIG. 24D, as depicted, each of the corpus data sets 3400 stored within the one or more storage devices 2100 may employ a 2D array data structure of rows 3421 and columns 3422. As also depicted, while each n-gram may occupy a single row 3421, each word within an n-gram occupies a separate column 3422 such that the number of columns occupied by each n-gram is based on the quantity of words that it includes. It should be noted that FIG. 24D depicts a deliberately highly simplified example of a very small n-gram corpus that includes relatively few uni-grams 3431 and relatively few bi-grams 3432. As depicted, the single word within each of the uni-grams 3431 occupies just column 3422 a, while the pair of words within each of the bi-grams 3432 occupies both columns 3422 a and 3422 b.

As will be familiar to those skilled in the art, the currently widely used standard format for organizing n-gram corpuses to implement a language model is the “ARPA” text format originally introduced by Doug B. Paul of the Massachusetts Institute of Technology. The ARPA format is generally implemented as an ASCII text file in which each n-gram is stored within a separate line of text separated by carriage returns. Although this format is widely accepted, it suffers various disadvantages, including slower access due to requiring a text parser to interpret the contents of each line (not all of which include n-grams). Another limitation of the ARPA format is the imposition of a requirement that all n-grams having the same quantity of words must be grouped together, and must be provided with a textual label indicating the quantity of words therein.

In contrast, the 2D array format depicted in FIG. 24D does not require a text parser for such purposes as it relies on the row-column organization of the array structure to enable speedier addressability and access to each word of n-gram. Also, as depicted, there may be no need to group the uni-grams 3431 together and separately from the bi-grams 3432, or to provide distinct labels or other form of identification for each group. Instead, it may simply be the quantity of columns 3422 occupied by each n-gram that determines the quantity of words therein. Again, the single word of each uni-gram 3431 occupies the single column 3422 a, while the pair of words of each bi-gram 3432 occupies the pair of columns 3422 a and 3422 b, and so on. However, it should be noted that such a 2D array format enables relatively easy importation of the n-grams and related information from the ASCII text file structure of the ARPA format. Specifically, a text parser may be used just once to parse such a text file structure to identify n-grams and related information with which to fill the rows of the 2D array format.

As a result of using such a 2D array format, the combining of the corpus data portions 3410 to form a new corpus data set 3400, or to add to an existing corpus data set 3400, becomes a relatively simple matter of combining rows 3421. In this way, the need for a text parser, as well as text file editing functionality, is eliminated.

Turning to FIG. 24E, following such combining of rows 3421 as part of combining corpus data portions 3410 containing newly generated n-grams, as just discussed, processor(s) 2550 of the control device 2500 may be caused to cooperate with the one or more storage devices 2100 to re-distribute the newly formed or newly augmented corpus data set 3400 among multiple node devices 2300 in preparation for being refined. More specifically, although the newly formed or newly augmented corpus data set 3400 may contain a relatively large quantity of newly generated n-grams, there may remain duplications of n-grams therein, at least as a result of having been generated in a distributed manner across multiple node devices 2300. Also, to fully enable the use of the corpus data set 3400 as a language model, relative frequencies and/or probabilities of occurrence for each n-gram must be calculated, or re-calculated.

Unlike the relatively simple division of the text data set 3700 into text data portions 3710 earlier discussed in reference to FIG. 24A, in FIG. 24E, the rows 3421 of n-grams within the corpus data set 3400 may be reorganized into groups based on hash values taken of each n-gram. More precisely, a hash value may be taken of each n-gram, and then the n-grams may be reorganized within the corpus data set 3400 based on an ascending or descending order of their hash values. This advantageously has the result of causing the rows 3421 of duplicate n-grams to become adjacent rows 3421. With the rows 3421 of n-grams so reorganized, sub-ranges of hash values within the full range of hash values may be derived as a mechanism for dividing the corpus data set 3400 into multiple corpus data groups 3415 that contain relatively similar quantities of rows 3421 for distribution among the multiple node devices 2300. In this way, each set of adjacent rows 3421 of duplicate n-gram is kept together and provided together to a single node device 2300 for deduplication.

As previously discussed, in some embodiments, it may be that processor(s) of the one or more storage devices 2100 are capable of performing at least a limited range of processing operations needed to maintain local and/or distributed file systems as part of storing data sets of widely varying sizes within either a single storage device 2100 or across multiple storage devices 2100. In such embodiments, the processor(s) of the one or more storage devices 2100 may be capable of performing at least a limited range of data reorganization functions, including the grouping of rows within array-type data structures based on a variety of organizing criteria, including hash values. Thus, in such embodiments, it may be that processor(s) 2550 of the control device are caused, by execution of the coordinating component 2519, to transmit a command to the one or more storage devices 2100 to cause such a reorganization of the rows 3421 within the corpus data set 3400, prior to the division of the corpus data set 3400 into the multiple corpus data groups 3415 by sub-ranges of those very same hash values.

Turning to FIG. 24F, within each of the multiple node devices 2300, execution of a compacting component 2318 may cause processor(s) 2350 thereof to iterate through the rows 3421 of n-grams within its corresponding corpus data group 3415 to identify instances of two or more rows 3421 containing duplicate n-grams. For each such instance of duplicate n-grams, the two or more rows 3421 containing duplicates of an n-gram may be reduced to a single row 3421 containing just a single copy of that n-gram, and an indication of at least the quantity of duplicates identified may be stored within the single row 3421.

As such deduplication of n-grams within each corpus data group 3415 is completed, the corpus data groups 3415 may be provided to the control device 2500, where they may be re-combined to recreate the corpus data set 3400. In so doing, execution of a probability component 2511 of the control routine 2510 may cause processor(s) 2550 of the control device 2500 to calculate values for the frequency and/or probability of occurrence for each n-gram, and to augment each row 3421 with those value(s). More specifically, and as depicted in FIG. 24G, one or more columns 3422 that were previously unoccupied across all of the rows 3421 may be caused to store such frequency and/or probability values.

Returning to FIG. 24F, as will be familiar to those skilled the art, there may arise situations in which the n-grams within the corpus data set 3400 do not cover all possible combinations of the words that are present within the corpus data set 3400. This may result in a default assignment of a zero probability value to such combinations of words as if such combinations could never occur, and this may adversely affect the accuracy of the resulting language mode in speech-to-text operations.

To at least mitigate this adverse affect, the processor(s) 2550 of the control device 2500 may be caused to provide one of a variety of types of “smoothing” of values indicative of probability of occurrence for at least a subset of the n-grams within the corpus data set 3400. More specifically, for at least some n-grams with a higher probability of occurring, their probability values may be reduced by a relatively small degree (thereby indicating a slightly reduced probability of occurring), and the probability value assigned for the occurrence of n-grams not included within the corpus data set 3400 may be increased to a non-zero value.

Among the widely accepted techniques for smoothing are various “backoff” calculations that may be used to derive a backoff value by which the probability values of at least a subset of the n-grams may be multiplied to reduce those values by a relatively small degree. As those skilled in the art will readily recognize, one widely used technique for calculating the backoff value is the Katz back-off model introduced by Slava M. Katz, but this technique becomes less effective as the size of the n-gram corpus increases. Another widely known technique is the “Stupid Backoff” introduced by Google, Inc. in 2007, but this technique is based on the use of a fixed value which, despite being capable of at least somewhat better results than the Katz back-off model, can also yield increasingly less effective results as the size of the n-gram corpus increases.

To better handle the potentially larger than commonplace size of the n-gram corpus within the corpus data set 3400, the probability component 2511 may employ an entirely new calculation:

${{Backoff}(n)} = \frac{❘{{Set}\left( {n{gram}} \right)}❘}{❘{{Set}\left( {n - {1{gram}}} \right)}❘}$

In this new calculation, the backoff value for an n-gram corpus of up to n words per n-gram may be derived by dividing the quantity of n-grams that include n words by the quantity of n-grams that include n-1 words. This backoff value is able to be quickly and simply calculated once, and then the values for the probability of occurrence of all of the n-grams may be multiplied by this backoff value. Since this backoff value is calculated based on the n-grams actually present within the corpus data set 3400, instead of being based on an arbitrary fixed value, the resulting n-gram perplexity is not rendered artificially smaller than it should be, thereby enabling better accuracy in the use of the corpus data set 3400 as a language model for speech-to-text processing operations.

FIGS. 25A, 25B, 25C, 25D, 25E and 25F, together, illustrate an example embodiment of a logic flow 4100. The logic flow 4100 may be representative of some or all of the operations executed by one or more embodiments described herein. More specifically, the logic flow 4100 may illustrate operations performed by core(s) 2351 and/or 2551 of the processor(s) 2350 and/or 2550 of the node devices 2300 and/or of the control device 2500, respectively, in executing various ones of the control routines 2310, 2340, 2510 and 2540.

Starting at FIG. 25A, at 4110, processor(s) of a control device of a processing system (e.g., the processor(s) 2550 of the control device 2500 of the processing system 2000 of FIGS. 14A-C) may receive a request from a requesting device via a network (e.g., the requesting device 2700 via the network 2999) to perform speech-to-text conversion of speech audio represented by a specified speech data set (e.g., one of the speech data sets 3100).

At 4112, pre-processing of the speech audio represented by the specified speech data set may begin with either a processor of the control device or processor(s) of one or more node devices of the processing system (e.g., one or more of the node devices 2300) dividing the speech data set into data chunks that each represent a chunk of the speech audio. As has been discussed, the pre-processing may entail the performances of multiple pause detection techniques (e.g., the combination of at least the APA pause detection technique of FIGS. 17A-C, and the CTC pause detection technique of FIGS. 18A-B) at least partially in parallel. As also discussed, where the processing system does include multiple node devices (e.g., the multiple node devices 2300), it may be that each pause detection technique is assigned to be performed by a different one of the node devices. Alternatively, where the processing system does not so include such a multitude of node devices, it may be that each pause detection technique is assigned to be performed by a different core and/or a different processor of the control device.

It should again be noted that the chunks of the speech audio used by different ones of the pause detection techniques may not be of the same size, or more precisely, may not represent chunks of the speech audio that are of the same length (e.g., as previously discussed, the chunks of speech audio generated for the APA pause detection technique may be shorter than those generated for the CTC pause detection technique). Therefore, it may be that multiple different sets of chunks of the speech audio are generated at 4112. More precisely, where each pause detection technique is assigned to a different node device or to a different thread of execution, it may be that the division of the speech audio into chunks is among the operations that are also so assigned such that separate node devices or separate cores are used to separately generate chunks of speech audio that are of appropriate length for their corresponding one of the pause detection techniques.

Regardless of the exact manner in which chunks of speech audio are generated at 4112, as depicted, multiple portions of pre-processing may be performed at least partially in parallel across FIGS. 25B-25D, including the APA and CTC pause detection techniques.

Turning to FIG. 25B, and following the generation of APA data chunks at 4112 that are of appropriate size for use as inputs to the APA pause detection technique (e.g., the data chunks 3110 a), at 4120, core(s) of a processor of either a node device or of the control device may analyze the chunk of speech audio represented by each APA data chunk to identify and measure the peak amplitude present therein. At 4122, with the peak amplitudes of each of the APA data chunks so measured, a pre-selected percentile amplitude may be derived from across all of the measured peak amplitudes from across all of the APA data chunks, and may be designated to serve as a threshold amplitude (e.g., the threshold amplitude 2232).

At 4124, the peak amplitude measured within each of the APA data chunks may be compared to the threshold amplitude. At 4126, each APA data chunk representing a chunk of speech audio having a peak amplitude greater than the threshold amplitude may be designated as a speech data chunk (e.g., a speech data chunk 3110 s), and each APA data chunk representing a chunk of speech audio having a peak amplitude less than the threshold amplitude may be designated as a pause data chunk (e.g., a pause data chunk 3110 p). Again, in various differing embodiments, each APA data chunk representing a chunk of speech audio having a peak amplitude equal to the threshold amplitude may be designated as either a speech data chunk or a pause data chunk.

At 4130, a first set of temporally consecutive APA data chunks of a pre-selected quantity, starting with the temporally earliest one of the APA data chunks, may be selected and analyzed to identify the longest consecutive subset of the APA data chunks therein that have been designated as pause data chunks, thereby corresponding to the longest pause present across all of the corresponding consecutive chunks of speech audio represented by the set of APA data chunks. The identified longest pause may be designated a likely sentence pause.

At 4132, an indication of the just-designated likely sentence pause may then be noted within an APA pause set of indications of likely sentence pauses (e.g., the APA pause set 3116 a of likely sentence pauses). As previously discussed, such an indication of a likely sentence pause within the APA pause set may include an indication of the temporal location of the likely sentence pause within the entirety of the speech audio.

At 4134, a check may be made of whether there are any more APA data chunks beyond (i.e., temporally later than) the set of APA data chunks just analyzed. If so, then at 4136, another set of temporally consecutive APA data chunks of a pre-selected quantity may be selected, where the newly selected set may start either 1) with the APA chunk that temporally follows the subset of APA data chunks that make up the longest pause of the last set, or 2) amidst the subset of APA data chunks that make up the longest pause of the last set (e.g., with the APA chunk at the midpoint of that longest pause). The newly selected set of APA data chunks may then be analyzed to identify the longest consecutive subset of the APA data chunks with the new set that have been designated as pause data chunks, thereby corresponding to the longest pause present across all of the corresponding consecutive chunks of speech audio represented by the set of APA data chunks. The identified longest pause may be designated a likely sentence pause. Again, at 4132, an indication of the just-designated likely sentence pause may then be noted within the APA pause set of likely sentence pauses.

However, if at 4134, there are no more APA data chunks beyond the set of APA data chunks just analyzed, then preparations are made to perform a speaker diarization technique, starting at 4160 in FIG. 25E.

Turning to FIG. 25C, and following the generation of APA data chunks at 4112 that are of appropriate size for use as inputs to the APA pause detection technique (e.g., the data chunks 3110 a), at 4114, core(s) of a processor of either a node device or of the control device may analyze the chunk of speech audio represented by each APA data chunk to identify and measure an amplitude of audio noise present therein. As previously discussed in reference to FIG. 17A, it may be that such measurements of a level of audio noise may be taken coincident with the taking of measurements of peak amplitude of each of the APA data chunks. However, it should be noted that other embodiments are possible in which measurements of a level of audio noise may be taken of other chunks generated for another of the multiple pause detection techniques, or measurement(s) may be taken of a level of audio noise in the speech audio at a time and/or in a manner that may be entirely unconnected with any of the pause detection techniques.

At 4116, with the audio noise levels of each of the APA data chunks so measured, at least one indication of the audio noise level within the speech audio (e.g., the audio noise level 3112) may be derived using any of a variety of ways. By way of example, and as previously discussed, such an indicated audio noise level may be based on average noise levels, lowest noise levels, and/or highest noise levels across all of the APA data chunks.

Following the derivation of the indicated audio noise level, preparations are made to perform a speaker diarization technique, starting at 4160 in FIG. 25E.

Turning to FIG. 25D, and following the generation of CTC data chunks at 4112 that are of appropriate size for use as inputs to the CTC pause detection technique (e.g., the data chunks 3110 c), at 4140, core(s) of a processor of either a node device or within the control device may instantiate and/or configure an acoustic model neural network within the node device or of the control device (e.g., the acoustic model neural network 2234). As has been discussed, the acoustic model neural network that is so configured may incorporate a CTC output (e.g., the CTC output 2235) that would normally be used to output a blank symbol that provides an indication of their being consecutive instances of a character that are not to be merged. At 4142, the temporally earliest one of the CTC data chunks may be provided to the acoustic model neural network as an input.

At 4144, if there are no strings of consecutive blank symbols output by the CTC output of the acoustic model neural network, then a check may be made at 4154 of whether there are any more CTC data chunks remaining to be provided to the acoustic model neural network as input. If there is at least one more of such CTC data chunks remaining, then the temporally next CTC data chunk (i.e., the next CTC data chunk in order from the temporally earliest to the temporally latest) may be provided to the acoustic model neural network as input at 4156.

However, if at 4144, there are one or more strings of consecutive blank symbols output by the CTC output of the acoustic model neural network in response to the provision thereto of a CTC data chunk as input, then at 4146, the length of each of those one or more strings may be compared to a pre-determined threshold blank string length. At 4148, if there is any string of consecutive blank symbols that is at least as long as the threshold blank string length, then each such string may be designated as a likely sentence pause. If, at 4150, there are no strings of consecutive blank symbols in the output of the neural network that have been so designated as likely sentence pauses, then the check of whether there are any more CTC data chunks remaining may be made at 4154. However, if at 4150, there are one or more strings of consecutive blank symbols that have been so designated as likely sentence pauses, then for each such string, an indication of a likely sentence pause may then be added to the CTC pause set of indications of likely sentence pauses at 4152, and then the check may be made at 4154 for more CTC data chunks.

However, if at 4164, there are no more CTC data chunks, then preparations are made to perform a speaker diarization technique, starting at 4160 in FIG. 25E.

Turning to FIG. 25E, at 4160, core(s) of a processor of either a node device or of the control device may continue the pre-processing of the speech audio of the speech data set by again dividing the speech data set into data chunks that each represent a chunk of the speech audio, this time for use in speaker diarization (e.g., the speaker diarization data chunks 3110 d). As has been discussed, the pre-processing may entail the performance of at least one speaker diarization technique (e.g., the speaker diarization technique of FIGS. 19A-D). As also discussed, where more than one speaker diarization technique is to be performed, and where the processing system does include multiple node devices (e.g., the multiple node devices 2300), it may be that each speaker diarization technique is assigned to be performed by a different one of the node devices. Alternatively, where the processing system does not so include such a multitude of node devices, it may be that each speaker diarization technique is assigned to be performed by a different core and/or a different processor of the control device. However, in the example performance of pre-processing and processing operations performed in this logic flow 4100, it is assumed that just a single speaker diarization technique is performed.

In addition to dividing the speech audio of the speech data set into speaker diarization data chunks, each of the speaker diarization data chunks may be further subdivided into data fragments. Further, at 4162, the indications of likely sentence pauses from each of the pause sets generated by the multiple pause detection techniques may be used to filter out (or otherwise remove) each data fragment that represents a portion of speech audio in which even a portion of a sentence pause is likely to have occurred. In this way, it becomes more likely that all of the data fragments that are present within each speaker diarization data chunk will include speech sounds.

At 4164, core(s) of a processor of either a node device or of the control device may instantiate and/or configure a speaker diarization neural network within the node device or within the control device (e.g., the speaker diarization neural network 2237).

At 4166, the temporally earliest one of the speaker diarization data chunks may be provided to the acoustic model neural network as an input. More precisely, each of the data fragments of that speaker diarization data chunk may be provided to the speaker diarization neural network as an input to cause the generation of a corresponding speaker vector. As previously discussed, each speaker vector includes a set of binary values and/or other numeric values that are descriptive of various vocal characteristics of a speaker.

At 4168, clustering of the speaker vectors generated from the data fragments of the temporally earliest speaker diarization data chunks may be performed to identify the speakers who spoke within the chunk of speech audio represented by the speaker diarization data chunk. As previously discussed, such clustering may include one or more repetitions of performances of clustering of the speaker vectors of the speaker diarization data chunk each time a new speaker is identified.

At 4170, each speaker vector is matched to one of the speakers identified through the performance of clustering for the speaker diarization data chunk. At 4172, the identities of the speakers assigned to each pair of temporally consecutive speaker vectors are compared to identify each instance of a likely change of speakers within the speaker diarization data chunk. At 4174, indications of any of such identified likely changes in speaker are stored within a change set of indications of likely speaker changes.

At 4176, a check may be made as to whether there are any speaker diarization data chunks remaining that have not been put through the speaker diarization technique just described. If so at 4176, then the temporally next speaker diarization data chunk may be provided to the speaker diarization neural network as an input at 4178. More precisely, each of the data fragments of that speaker diarization data chunk may be provided to the speaker diarization neural network as an input to cause the generation of a corresponding speaker vector.

However, if at 4176, there are no more speaker diarization data chunks, then segmentation may be performed at 4180 in FIG. 25F in preparations for perform speech-to-text processing.

Turning to FIG. 25F, at 4180, core(s) of a processor of either a node device or of the control device may assign relative weighting factors to each of the pause detection techniques by which a pause set of likely sentence pauses has been generated. As has been discussed, such weighting factors may be made dynamically adjustable based on the earlier derived indication of audio noise level, and this may be done in recognition of the differing degrees to which each of the pause detection techniques is susceptible to the presence of audio noise within speech audio. At 4182, the assigned relative weighting factors may be used in the combining of the multiple pause sets of likely sentences pauses to generate a single set of indications of likely sentence pauses.

At 4184, core(s) of a processor of each of one or more node devices, and/or core(s) of a processor of the control device may then use the single set of indications of likely sentence pauses together with the change set of indications of likely speaker changes from the performance of the speaker diarization technique to generate a segmentation set of indications of the manner in which the speech data set is to be divided into data segments that each represent a segment of the speech audio of the speech data set.

At 4186, core(s) of a processor of each of one or more node devices, and/or cores(s) of a processor of the control device may re-divide the speech data set into data segments that each represent a segment of the speech audio based on the segmentation set. With the provision of segments of the speech audio to use as an input, the processing operations to perform the requested speech-to-text may begin. As has been discussed, due to the performance of the pre-processing operations, each point at which the speech audio is divided to form segments is at least likely to be a midpoint of a sentence pause and/or of a speaker change, thereby making it more likely that each segment will fully contain the complete pronunciations of phonemes, words and/or entire sentences by an individual speaker.

At 4190, feature detection is performed on each segment to detect instances of a pre-selected set of acoustic features that are to be provide as an input to an acoustic model for purposes of identifying likely text characters. At 4192, within each node device and/or within the control device, core(s) of a processor may again instantiate an acoustic model neural network with CTC output, but this time for purposes of identifying characters. Again, the same type of acoustic model neural network with CTC output that was used for the CTC pause detection technique may be used again for character identification.

At 4194, each data segment is provided to the acoustic model neural network as input for the identification of likely text characters (along with blank symbols used to identify instances of identical consecutive text characters). At 4196, such identified text characters are provided to implementation(s) of a language model as input for the identification of words.

At 4198, a processor of a node device or a processor of the control device may assemble the identified words, in temporal order, to form text data that represents the text into which the speech audio of the speech data set has been converted (e.g., the text data 2519). As previously discussed, such text data may then be transmitted back to the device from which the request was received to perform the speech-to-text conversion.

FIG. 26 illustrates an example embodiment of another logic flow 4200. The logic flow 4200 may be representative of some or all of the operations executed by one or more embodiments described herein. More specifically, the logic flow 4200 may illustrate operations performed by core(s) 2351 and/or 2551 of the processor(s) 2350 and/or 2550 of the node devices 2300 and/or of the control device 2500, respectively, in executing various ones of the control routines 2340 and 2540.

At 4210, core(s) of processor(s) of a node device of a processing system (e.g., the core(s) 2351 of the processor(s) 2350 of one of the node devices 2300 of the processing system 2000 of FIGS. 14A-C), or core(s) of processor(s) of a control device of the processing system (e.g., the core(s) 2551 of the processor(s) 2550 of the control device 2500 of the processing system 2000 of FIGS. 14A-C) may perform feature detection on one or more consecutive frames of a segment of speech audio covering a period of time during which a next word was spoken. As has been discussed, the output of the performance of feature detection may be data structures (e.g., the feature vectors 3142) that provide indications of detected instances of various acoustic features, along with indications of when those instances occurred.

At 4212, such feature vectors generated from the performance of feature detection may be provided as input to an acoustic model. As has been discussed, the acoustic model may be implemented using a neural network (e.g., the neural network 2355 or 2555, which may include a CTC output 2356 or 2556, respectively), or using any of a variety of other technologies.

At 4214, the core(s) of the processor(s) of either the node device or the control device may be caused to use the acoustic model with the feature vectors as input to generate corresponding probability distributions of graphemes. As has been discussed, each grapheme may be correlated, either individually or in various combinations, to one or more speech sounds. As a result, each of the probability distributions provides an indication of relative probabilities of various different speech sounds having been uttered at a particular time.

At 4216, from multiple probability distributions that are associated with the pronunciation of the next single word that was spoken and that is to be identified for addition to a transcript, a set of a pre-determined quantity of candidate words (e.g., the candidate words 3145) may be generated, where each of the candidate words is among those that are most likely to be the next spoken word. At 4220, for each candidate word in the set of candidate words, a corresponding candidate n-gram may be generated that is to become part of a corresponding set of candidate n-grams (e.g., the set 3146 of candidate n-grams).

At 4222, the core(s) of the processor(s) of either the node device or the control device may be caused to use the language model with the set of candidate n-grams as input to generate a corresponding set of probabilities (e.g., one of the probability sets 3147). As has been discussed, where the language model is based on an n-gram corpus (e.g., one of the corpus data sets 3400), beam searches may be used to retrieve the per-n-gram probabilities stored as part of the n-gram corpus. As a result, each of the probability sets provides the relative probabilities of the set of n-grams, thereby enabling the most probable candidate n-gram of that set to be determined, and in so doing, enabling the most probable corresponding candidate word to be identified as the next most likely word to be spoken, according to the language model.

At 4230, each of the probability distributions for graphemes associated with the next word may be analyzed to derive an aggregate degree of uncertainty for those probability distributions. If, at 4232, the resulting degree of uncertainty is greater than a pre-determined threshold level, then at 4234, greater weighting may be given to relying on the language model to identify the next word most likely to have been spoken. However, if at 4232, the resulting degree of uncertainty is less than the pre-determined threshold level, then at 4236, greater weighting may be given to relying on the acoustic model to identify the next word most likely to have been spoken.

FIG. 27 illustrates one embodiment of a method 4300 for detecting a plurality of speakers within a speech data corpus. It shall be appreciated that other examples contemplated within the scope of the present disclosure may involve more operations, fewer operations, different operations, or a different order of operations than as shown in FIG. 27 .

In some embodiments, the method 4300 may include a process 4301 that functions to distribute a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads. As will be described in more detail herein, in some embodiments, distributing the plurality of audio data files may relate to a process or operation that enables the method 4300 to execute the plurality of audio data files independently of one another and/or may relate to a process or operation that enables the method 4300 to balance computational requirements associated with the processing of the plurality of audio data files. Various non-limiting embodiments and examples of distributing the plurality of audio data files will now be described.

In some embodiments, distributing the plurality of audio data files may include distributing multiple audio data files to one or more target computing nodes. For instance, in the example illustrated in FIG. 28 , the process 4301 is distributing multiple audio data files 4304 a-4304 c of the speech data corpus 4302 to computing node 4306 a. It shall be noted that, while FIG. 28 illustrates the process 4301 distributing a plurality of audio data files to only a single computing node (e.g., computing node 4306 a), other examples and embodiments of process 4301 may include distributing a plurality of audio data files to at least a plurality of computing nodes (e.g., computing nodes 4306 b and/or 4306 n).

Additionally, or alternatively, in some embodiments, distributing the plurality of audio data files may include distributing at least a subset of the plurality of audio data files across different computing nodes. For instance, as also shown in FIG. 28 , the process 4301 is distributing the plurality of audio data files 4304 a-4304 n across computing nodes 4306 a and 4306 b. It shall be noted that, while FIG. 28 illustrates process 4301 distributing the speech data corpus 4302 across two different computing nodes (e.g., 4306 a and 4306 b), other examples and embodiments of process 4301 may include distributing the plurality of audio data files 4304 a-4304 n across different or additional computing nodes. For instance, in a non-limiting example, the process 4301 may, alternatively, function to distribute the audio data file 4304 c to computing node 4306 b or 4306 n instead of computing node 4306 a.

In some embodiments, the one or more audio data files distributed to a respective computing node may be (e.g., concurrently) processed by one or more audio processing threads implemented at the respective computing node, as will be described in more detail herein. For instance, as shown in FIG. 28 , based on receiving the plurality of audio data files 4304 a-4304 c, the computing node 4306 a further assigns the plurality of audio data files 4304 a, 4304 b, and 4304 c to audio processing threads 4310 a, 4310 b, and 4310 c of audio processing thread pool 4308 a. Similarly, based on receiving the audio data file 4304 n, the computing node 4306 b further assigns the audio data file 4304 n to audio processing thread 4310 e of audio processing thread pool 4308 b.

It shall be noted that, in some embodiments, the speech data corpus distributed via process 4301 may be of any suitable data structure. For instance, in a non-limiting example, the speech data corpus 4302 illustrated in FIG. 28 may store the plurality of audio data files 4304 a-4304 n in a tabular data structure comprising one or more rows and one or more columns. In such example, each of the plurality of audio data files 4304 a-4304 n may be stored within a distinct row of the tabular data structure. It shall also be noted that the speech data corpus described herein may be similar to or the same as the speech data set 3100 illustrated in FIGS. 17A-17C, 18A-18B, and 19A. That is, in some embodiments, the speech data corpus may include (e.g., store) a plurality of audio data files that each include speech audio or speech sounds spoken by one or more speakers.

Alternatively, in some embodiments, the speech data corpus may be a multi-column table. In such embodiments, the speech data corpus may include one or more rows that each correspond to a respective audio data file and a plurality of columns that are each configured to store an attribute or property of a respective audio data file. For instance, in the example illustrated in FIG. 28 , a row in the speech data corpus 4302 corresponding to the audio data file 4304 a may store an identification value (e.g., ID) of the audio data file 4304 a along a first column of the speech data corpus 4302 and binary audio data associated with the audio data file 4304 a along a second column of the speech data corpus 4302. It shall be noted that other rows of the speech data corpus 4302, such as the rows corresponding to the audio data files 4304 b-4304 n, may have a similar or analogous structure.

Referring back to FIG. 27 , in some embodiments, the method 4300 may include a process 4303 that functions to execute the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files. As will described in more detail herein, in some embodiments, detecting a plurality of tentative speakers participating in a respective audio data file may relate to a process or technique for detecting and/or uniquely identifying each speaker participating (e.g., speaking) in the respective audio data file. Thus, in some embodiments, an output of the process 4303 may aid processes 4305 and 4307 in correlating tentative speakers detected across the plurality of audio data files to a same global speaker or different global speakers.

It shall be noted that, as generally referred to herein, a “tentative speaker” may relate to a unique speaker within a set of audio data segments extracted from (e.g., partitioned from) one or more audio data files distributed to a respective computing node, and a “global speaker” may relate to a unique speaker across the plurality of audio data files of the speech data corpus.

In some embodiments, the plurality of audio processing threads executed by the process 1403 may be similar to or the same as audio processing thread 4310 illustrated in FIG. 29 and/or may include one or more models or algorithms for performing processes 4303 a-4303 d. As shown in FIG. 29 , the audio processing thread 4310 may function to provide a target audio data file 4309 to an audio data partitioning model 4312. The target audio data file 4309, in some embodiments, may correspond to the audio data file that was distributed to the audio processing thread 4310 via process 4301. For instance, in a non-limiting example with reference to FIGS. 28 and 29 , the target audio data file 4309 of audio processing thread 4310 a may correspond to audio data file 4304 a because the computing node 4306 a assigned the audio data file 4304 a to the audio processing thread 4310 a (as previously described above). Similarly, in yet another non-limiting example with continued reference to FIGS. 28 and 29 , the target audio data file 4309 of audio processing thread 4310 b may correspond to audio data file 4304 b because the computing node 4306 a assigned the audio data file 4304 b to the audio processing thread 4310 b (as also previously described above).

In some embodiments, based on receiving the target audio data file 4309, the audio data partitioning model 4312 may function to partition the target audio data file 4309 into a plurality of audio data segments 4314. The audio data partitioning model 4312, in some embodiments, may be similar to or the same as the division component 2311 illustrated and described in FIGS. 17A-C, FIGS. 18A-B, or FIGS. 19A-19D. Thus, in some embodiments, the audio data partitioning model 4312 may function to filter out segments of the target audio data file 4309 that do not include speech audio or speech sounds and, in turn, output segments of the target audio data file 4309 that include speech audio or speech sounds. In such embodiments, each of the plurality of audio data segments 4314 may correspond to one of the segments within the target audio data file 4309 identified as including speech audio or sounds. Thus, in some examples, the method 4300 may include a process 4303 a that functions to partition the target audio data file of the plurality of audio data files into a plurality of audio data segments.

In some embodiments, as also illustrated in FIG. 29 , the audio processing thread 4310 may provide the plurality of audio data segments 4314 to one or more feature extraction algorithm(s) 4316. In turn, the one or more feature extraction algorithm(s) 4316 may function to output a plurality of feature vectors 4318 that each correspond to one of the plurality of audio data segments 4314. For instance, in a non-limiting example, the plurality of feature vectors 4318 outputted by the one or more feature extraction algorithm(s) 4316 may at least include a first feature vector that corresponds to a first audio data segment inputted into the one or more feature extraction algorithm(s) 4316 and a second feature vector that corresponds to a second audio data segment inputted into the one or more feature extraction algorithm(s) 4316. It shall be noted that a feature vector generated for a target audio data segment may relate to a one-dimensional or multi-dimensional array that stores a plurality of values of acoustic features extracted from the target audio data segment (e.g., Mel Frequency Cepstral Coefficients (“MFCC”) features, Filterbank Energies (“FBANK”) features, Log Filterbank Energies (“LOGFBANK”) features, and/or Spectral Subband Centroid (“SSC”) features).

In some embodiments, as illustrated in FIG. 30 , the audio processing thread 4310 may provide the plurality of feature vectors 4318 to an embeddings model 4320. The embeddings model 4320, in some embodiments, may relate to a supervised machine learning model (e.g., CNN), semi-supervised machine learning model, or an unsupervised machine learning model (e.g., a transformer model, embeddings model, or the like) that is configured to compute one or more embedding values for one or more acoustic feature vectors provided as input. It shall be noted that an embedding value computed for a target feature vector may relate to a one-dimensional or multi-dimensional array comprising one or more data entries that numerically represent the target feature vector—and, optionally, in a lower dimensional space as compared to the target feature vector.

Accordingly, in turn, based on receiving the plurality of feature vectors 4318, the embeddings model 4320 may function to output a plurality of embedding values 4322 that each correspond to one of the plurality of feature vectors 4318. For instance, in a non-limiting example, the plurality of embedding values 4322 outputted by the embeddings model 4320 may at least include a first embedding value of a first feature vector inputted into the embeddings model 4320 and a second embedding value of a second feature vector inputted into the embeddings model 4320. Thus, in some examples, the method 4300 may include a process 4303 b that functions to compute a plurality of embedding values based on the plurality of audio data segments (e.g., the feature vectors corresponding to the plurality of audio data segments).

In some embodiments, as also illustrated in FIG. 30 , the audio processing thread 4310 may provide the plurality of embedding values 4322 to a clustering algorithm 4324 (e.g., PROC KCLUS, PROC CLUSTER, K-means, fuzzy K-means, convolutional neural network(s) (CNN), or any other suitable supervised or unsupervised model). In turn, based on receiving the plurality of embedding values 4322, the clustering algorithm 4324 may function to cluster the plurality of embedding values 4322 into a plurality of audio data segment clusters 4326. Thus, in some examples, the method 4300 may include a process 4303 c that functions to generate, via a clustering algorithm, a plurality of clusters of audio data segments based on the plurality of embedding values. It shall be noted that, in some embodiments, clustering the plurality of embedding values 4322 may aid the method 4300 in grouping embedding values that are likely similar to one another.

For instance, in the example illustrated in FIG. 32 , the clustering algorithm 4324 clustered the plurality of embedding values 4322 into a plurality of audio data segment clusters 4326 a-4326 d. Specifically, in FIG. 32 , the embedding values of audio data segments A-F, M-R, G-L, and S-X were clustered into the audio data segment clusters 4326 a, 4326 b, 4326 c, and 4326 d, respectively. Thus, in such an example, the method 4300 may function to identify that the audio data segments included within a same audio data segment cluster are likely semantically similar or share similar features (e.g., include speech audio or utterances spoken by a same tentative speaker).

That is, in a non-limiting example, the method 4300 may function to identify audio data segments A-F as likely being similar to one another based on the clustering algorithm 4324 clustering the embedding values of such audio data segments into a same audio data segment cluster (e.g., audio data segment cluster 4326 a). It shall be noted that the method 4300 may perform similar or analogous determinations for the other audio data segment clusters generated by the clustering algorithm 4324 (e.g., audio data segment clusters 4326 b-4326 d).

It shall also be noted that the example illustrated in FIG. 32 is not meant to be limiting and that, in other embodiments, the clustering algorithm 4324 may generate more, fewer, or different audio data segments clusters without departing from the scope of the present disclosure.

In some embodiments, the audio processing thread 4310 may identify a plurality of tentative speakers 4340 participating in the target audio data file 4309 based on the plurality of audio data segment clusters 4326. In one example of such embodiments, the audio processing thread 4310 may determine that each of the plurality of audio data segment clusters 4326 represents a distinct tentative speaker participating in the target audio data file 4309. For instance, in the example of FIG. 32 , the audio processing thread 4310 may function to identify that the audio data segment cluster 4326 a represents a first tentative speaker in the target audio data file 4309, the audio data segment cluster 4326 b represents a second tentative speaker in the target audio data file 4309, the audio data segment cluster 4326 c represents a third tentative speaker in the target audio data file 4309, and the audio data segment cluster 4326 d represents a fourth tentative speaker in the target audio data file 4309.

In some embodiments, as illustrated in FIG. 31 , the audio processing thread 4310 may provide the plurality of audio data segment clusters 4326 to a speaker signature generation module 4328. Based on receiving the plurality of audio data segment clusters 4326, the speaker signature generation module 4328 may function to output a plurality of embedding signatures 4330 that each correspond to one of the plurality of tentative speakers participating in the target audio data file 4309. Thus, in some examples, the method 4300 may include a process 4303 d that functions to compute a plurality of embedding signatures for the plurality of tentative speakers participating in the target audio data file based on the plurality of clusters of audio data segments.

It shall be noted that, in some embodiments, an embedding signature computed for a target tentative speaker may be a one-dimensional or multi-dimensional array of embeddings data that uniquely encodes speaking characteristics of the target tentative speaker. Thus, for example, when compared to one another, the embedding signature generated for each of the plurality of tentative speakers in the target audio file 4309 may be different as each tentative speaker may have different vocal characteristics (e.g., a different amplitude, frequency, tone, rhythm, resonance, inflection, or the like).

In some embodiments, the speaker signature generation module 4328 may generate an embedding signature for a target tentative speaker based on a centroid of an audio data segment cluster associated with the target tentative speaker. That, is in some embodiments, based on receiving an audio data segment cluster associated with a target tentative speaker, the speaker signature generation module 4328 may function to compute a centroid of such audio data segment cluster and, in turn, use the centroid as the embedding signature for the target tentative speaker.

For instance, in a non-limiting example with continued reference to FIG. 32 , the speaker signature generation module 4328 may generate an embedding signature for a first tentative speaker in the target audio data file 4309 by computing a centroid of the audio data segment cluster 4326 a and, in turn, using the centroid as the embedding signature for the first tentative speaker. It shall be noted that the audio processing thread 4310 may perform similar or analogous operations when computing the embedding signatures for the other tentative speakers participating in the target audio data file 4309.

Additionally, or alternatively, in some embodiments, the speaker signature generation module 4328 may use a speaker signature embeddings machine learning model (e.g., a neural network) to generate the plurality of embedding signature 4330. The speaker signature embeddings machine learning model, in some embodiments, may be configured to receive, as input, one or more audio data segment embedding values associated with a target tentative speaker and, in turn, compute an output comprising an embedding representation of the provided input.

Accordingly, in one example of such embodiments with continued reference to FIG. 32 , the speaker signature generation module 4328 may generate an embedding signature for a first tentative speaker in the target audio data file 4309 by providing the embedding values of audio data segments A-F as input into the speaker signature embeddings machine learning model and, in turn, using the embedding representation generated based on the provided input as the embedding signature for the first tentative speaker. Like in the previous example, it shall also be noted that the method 4300 may perform similar or analogous operations when computing the embedding signatures for the other tentative speakers participating in the target audio data file 4309.

In some embodiments, the plurality of audio processing threads associated with the plurality of audio data files may be concurrently executed by the process 4303. Thus, in such embodiments and as a result of concurrently executing the plurality of audio processing threads, the process 4303 may function to concurrently detect the plurality of tentative speakers participating in each of the plurality of audio data files and/or may function to concurrently generate the plurality of embedding signatures for each of the plurality of tentative speakers participating in each of the plurality of audio data files.

For instance, in the example of FIG. 33 , the process 4303 may function to concurrently execute the audio processing threads 4310 a, 4310 b, 4310 c, and 4310 e associated with the plurality of audio data files 4304 a, 4304 b, 4304 c, and 4304 n. Thus, as a result, the process 4303 may function to concurrently compute the plurality of embeddings signatures 4330 a-4330 n associated with the plurality of tentative speakers participating in each of the plurality of audio data files 4304 a-4304 n, respectively. It shall be noted that the example illustrated in FIG. 33 is not intended to be limiting and that the process 4303 may function to execute more, fewer, or different audio processing threads than as illustrated.

Referring back to FIG. 27 , in some embodiments, the method 4300 may include a process 4305 that functions to generate, via the clustering algorithm, a plurality of clusters of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files. As will be described in more detail herein, in some embodiments, generating the plurality of clusters of embedding signatures may relate to a process or operation that enables the method 4300 to relate embeddings signatures of tentative speakers detected in different audio data files. Thus, an output of process 4305 may enable the method 4300 to identify whether a tentative speaker in a first respective audio data file and a tentative speaker in a second respective audio data file relate to a same global speaker or different global speakers.

In some embodiments, the clustering algorithm of process 4305 may be implemented at a main computing node. The main computing node, in some embodiments, may be operatively connected or linked to a plurality of sub-nodes that each correspond to a distinct one of the plurality of computing nodes described herein. It shall be noted that, as generally referred to herein, a main computing node operatively connected to one or more computing sub-nodes may enable the main computing node to obtain or collect data generated at each of the plurality of sub-nodes. For instance, in the example of FIG. 33 , the main computing node may comprise a plurality of computing sub-nodes including the plurality of computing nodes 4306 a-4306 n, which may enable the main computing node to collect or obtain the plurality of embedding signatures 4330 a-4330 n generated via the plurality of computing nodes 4306 a-4306 n.

In some embodiments, based on collecting the plurality of embedding signatures from the plurality of computing nodes, the process 4305 may function to provide the plurality of embedding signatures as input into the clustering algorithm 4324. The clustering algorithm 4324 may, in turn, function to generate a plurality of clusters of embedding signatures based on the input of the plurality of embedding signatures. For instance, in the example of FIG. 34 , the process 4305 provides the plurality of embedding signatures 4330 a-4330 n to the clustering algorithm 4324 and, as a result, causes the clustering algorithm 4324 to cluster the plurality of embedding signatures 4330 a-4330 n into a plurality of embedding signature clusters 4336 a-4336 f.

In some embodiments, each of the plurality of embedding signature clusters generated via the clustering algorithm may include a plurality of embedding signatures that are likely similar or related. For instance, in the example of FIG. 34 , the clustering algorithm 4324 clustered the embedding signatures of tentative speakers A-F, G-L, M-R, S-X, Y-DD, and EE-JJ into embedding signature clusters 4336 a-4336 f, respectively. Thus, in such an example, the method 4300 may function to identify that the tentative speakers A-F are likely related or similar to one another based on the clustering algorithm 4324 clustering the embedding signatures of tentative speakers A-F into a same embedding signature cluster (e.g., embedding signature cluster 4336 a). It shall be noted that the method 4300 may perform analogous determinations with respect to the other embedding signature clusters generated by the clustering algorithm 4324.

It shall also be noted that the example illustrated in FIG. 34 is not meant to be limiting and that, in other embodiments, the clustering algorithm 4324 may generate more, fewer, or different embedding signature clusters without departing from the scope of the various described embodiments.

Referring back to FIG. 27 , in some embodiments, the method 4300 may include a process 4307 that functions to detect a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures. As will be described in more detail herein, in some embodiments, detecting the plurality of global speakers may relate to a process or operation that enables the method 4300 to identify unique speakers across the plurality of audio data files of the speech data corpus.

In some embodiments, each of the plurality of embedding signature clusters generated by the clustering algorithm may include a plurality of embedding signatures that are likely similar or related to a same global speaker. For instance, in the example of FIG. 34 , the clustering algorithm 4324 clustered the embedding signatures of tentative speakers A-F, G-L, M-R, S-X, Y-DD, and EE-JJ into embedding signature clusters 4336 a-4336 f, respectively. Thus, in such an example, the method 4300 may function to detect that the tentative speakers A-F are likely related or similar to one another based on the clustering algorithm 4324 clustering the embedding signatures of tentative speakers A-F into a same embedding signature cluster (e.g., embedding signature cluster 4336 a).

Stated differently, in some embodiments, the process 4307 may determine that a plurality of tentative speakers relate to a same global speaker if the embedding signatures of the plurality of tentative speakers belong to a same cluster of embedding signatures. For instance, in the example of FIG. 34 , the process 4307 may determine that tentative speakers A-F detected across the plurality of audio data files 4304 a-4304 n relate to a same global speaker of the plurality of global speakers 4338 in the speech data corpus 4302 based on detecting that the embedding signatures of tentative speakers A-F belong to a same cluster of embedding signatures (e.g., embedding signature cluster 4336 a).

Conversely, in some embodiments, the process 4307 may determine that a plurality of tentative speakers relate to different global speakers if the embedding signatures of the plurality of tentative speakers do not belong to a same cluster of embedding signatures. For instance, in the example of FIG. 34 , the process 4307 may determine that tentative speakers A and S detected in the plurality of audio data files 4304 a-4304 n relate to different global speakers in the speech data corpus 4302 based on identifying that the embedding signatures of tentative speakers A and S belong to different clusters of embedding signatures (e.g., embedding signature clusters 4336 a and 4336 d, respectively).

Additionally, or alternatively, in some embodiments, the process 4307 may function to associate a unique global speaker label with each of the plurality of embedding signature clusters. For instance, in the example of FIG. 34 , the process 4307 may function to associate the embeddings signature cluster 4336 a with a first unique global speaker label, such as “Global Speaker A” or “Global Speaker #1.” It shall be noted that the other embedding signature clusters illustrated in FIG. 34 may be labeled in analogous or similar ways (e.g., label embedding signature cluster 4336 b as “Global Speaker B” or “Global Speaker #2”).

It shall also be noted that the system and methods of the embodiment and variations described herein can be embodied and/or implemented at least in part as a machine configured to receive a computer-readable medium storing computer-readable instructions. The instructions are preferably executed by computer-executable components preferably integrated with the system and one or more portions of the processors and/or the controllers. The computer-readable medium can be stored on any suitable computer-readable media such as RAMs, ROMs, flash memory, EEPROMs, optical devices (CD or DVD), hard drives, floppy drives, cloud-based services, or any suitable device. The computer-executable component is preferably a general or application specific processor, but any suitable dedicated hardware or hardware/firmware combination device can alternatively or additionally execute the instructions.

The systems and methods of the preferred embodiments may additionally, or alternatively, be implemented on an integrated data analytics software application and/or software architecture such as that are offered by SAS Institute Inc. of Cary, N.C., USA. Merely for illustration, the systems and methods of the preferred embodiments may be implemented using or integrated with one or more SAS software tools such as SAS® Viya™ which is developed and provided by SAS Institute Inc. of Cary, N.C., USA.

Although omitted for conciseness, the preferred embodiments include every combination and permutation of the implementations of the systems and methods described herein.

As a person skilled in the art will recognize from the previous detailed description and from the figures and claims, modifications and changes can be made to the embodiments of the disclosure without departing from the scope of the various described embodiments.

In various embodiments, each of the processors 2350, 2550 and 2750 may include any of a wide variety of commercially available processors. Further, one or more of these processors may include multiple processors, a multi-threaded processor, a multi-core processor (whether the multiple cores coexist on the same or separate dies), and/or a multi-processor architecture of some other variety by which multiple physically separate processors are linked.

However, in a specific embodiment, the processor(s) 2350 of each of the one or more node devices 2300 may be selected to efficiently perform the analysis of multiple instances of pre-processing, processing and/or post-processing operations at least partially in parallel. By way of example, the processors 2350 may incorporate a single-instruction multiple-data (SIMD) architecture, may incorporate multiple processing pipelines, and/or may incorporate the ability to support multiple simultaneous threads of execution per processing pipeline. Alternatively, or additionally by way of example, the processor 1550 may incorporate multi-threaded capabilities and/or multiple processor cores to enable parallel performances of the tasks of more than job flow.

In various embodiments, each of the control routines 2310, 2340, 2370, 2510, 2540, 2570 and 2740, including the components of which each is composed, may be selected to be operative on whatever type of processor or processors that are selected to implement applicable ones of the processors 2350, 2550 and/or 2750 within each one of the devices 2300, 2500 and/or 2700, respectively. In various embodiments, each of these routines may include one or more of an operating system, device drivers and/or application-level routines (e.g., so-called “software suites” provided on disc media, “applets” obtained from a remote server, etc.). Where an operating system is included, the operating system may be any of a variety of available operating systems appropriate for the processors 2350, 2550 and/or 2750. Where one or more device drivers are included, those device drivers may provide support for any of a variety of other components, whether hardware or software components, of the devices 2300, 2500 and/or 2700.

In various embodiments, each of the storages 2360, 2560 and 2760 may be based on any of a wide variety of information storage technologies, including volatile technologies requiring the uninterrupted provision of electric power, and/or including technologies entailing the use of machine-readable storage media that may or may not be removable. Thus, each of these storages may include any of a wide variety of types (or combination of types) of storage device, including without limitation, read-only memory (ROM), random-access memory (RAM), dynamic RAM (DRAM), Double-Data-Rate DRAM (DDR-DRAM), synchronous DRAM (SDRAM), static RAM (SRAM), programmable ROM (PROM), erasable programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), flash memory, polymer memory (e.g., ferroelectric polymer memory), ovonic memory, phase change or ferroelectric memory, silicon-oxide-nitride-oxide-silicon (SONOS) memory, magnetic or optical cards, one or more individual ferromagnetic disk drives, non-volatile storage class memory, or a plurality of storage devices organized into one or more arrays (e.g., multiple ferromagnetic disk drives organized into a Redundant Array of Independent Disks array, or RAID array). It should be noted that although each of these storages is depicted as a single block, one or more of these may include multiple storage devices that may be based on differing storage technologies. Thus, for example, one or more of each of these depicted storages may represent a combination of an optical drive or flash memory card reader by which programs and/or data may be stored and conveyed on some form of machine-readable storage media, a ferromagnetic disk drive to store programs and/or data locally for a relatively extended period, and one or more volatile solid state memory devices enabling relatively quick access to programs and/or data (e.g., SRAM or DRAM). It should also be noted that each of these storages may be made up of multiple storage components based on identical storage technology, but which may be maintained separately as a result of specialization in use (e.g., some DRAM devices employed as a main storage while other DRAM devices employed as a distinct frame buffer of a graphics controller).

However, in a specific embodiment, the storage 2560 in embodiments in which the one or more of the federated devices 2500 provide federated spaces 2566, or the storage devices 2600 in embodiments in which the one or more storage devices 2600 provide federated spaces 2566, may be implemented with a redundant array of independent discs (RAID) of a RAID level selected to provide fault tolerance to objects stored within the federated spaces 2566.

In various embodiments, the input device 2720 may be any of a variety of types of input device that may each employ any of a wide variety of input detection and/or reception technologies. Examples of such input devices include, and are not limited to, microphones, remote controls, stylus pens, card readers, finger print readers, virtual reality interaction gloves, graphical input tablets, joysticks, keyboards, retina scanners, the touch input components of touch screens, trackballs, environmental sensors, and/or either cameras or camera arrays to monitor movement of persons to accept commands and/or data provided by those persons via gestures and/or facial expressions.

In various embodiments, the display 2780 may be any of a variety of types of display device that may each employ any of a wide variety of visual presentation technologies. Examples of such a display device includes, and is not limited to, a cathode-ray tube (CRT), an electroluminescent (EL) panel, a liquid crystal display (LCD), a gas plasma display, etc. In some embodiments, the display 2780 may be a touchscreen display such that the input device 2720 may be incorporated therein as touch-sensitive components thereof.

In various embodiments, each of the network interfaces 2390, 2590 and 2790 may employ any of a wide variety of communications technologies enabling these devices to be coupled to other devices as has been described. Each of these interfaces includes circuitry providing at least some of the requisite functionality to enable such coupling. However, each of these interfaces may also be at least partially implemented with sequences of instructions executed by corresponding ones of the processors (e.g., to implement a protocol stack or other features). Where electrically and/or optically conductive cabling is employed, these interfaces may employ timings and/or protocols conforming to any of a variety of industry standards, including without limitation, RS-232C, RS-422, USB, Ethernet (IEEE-802.3) or IEEE-1394. Where the use of wireless transmissions is entailed, these interfaces may employ timings and/or protocols conforming to any of a variety of industry standards, including without limitation, IEEE 802.11a, 802.11ad, 802.11ah, 802.11ax, 802.11b, 802.11g, 802.16, 802.20 (commonly referred to as “Mobile Broadband Wireless Access”); Bluetooth; ZigBee; or a cellular radiotelephone service such as GSM with General Packet Radio Service (GSM/GPRS), CDMA/1xRTT, Enhanced Data Rates for Global Evolution (EDGE), Evolution Data Only/Optimized (EV-DO), Evolution For Data and Voice (EV-DV), High Speed Downlink Packet Access (HSDPA), High Speed Uplink Packet Access (HSUPA), 4G LTE, 5G, etc.

However, in a specific embodiment, one or more of the network interfaces 2390 and/or 2590 may be implemented with multiple copper-based or fiber-optic based network interface ports to provide redundant and/or parallel pathways in exchanging at least the speech data sets 2130.

In various embodiments, the division of processing and/or storage resources among the federated devices 1500, and/or the API architectures employed to support communications between the federated devices and other devices may be configured to and/or selected to conform to any of a variety of standards for distributed processing, including without limitation, IEEE P2413, AllJoyn, IoTivity, etc. By way of example, a subset of API and/or other architectural features of one or more of such standards may be employed to implement the relatively minimal degree of coordination described herein to provide greater efficiency in parallelizing processing of data, while minimizing exchanges of coordinating information that may lead to undesired instances of serialization among processes. However, it should be noted that the parallelization of storage, retrieval and/or processing of portions of the speech data sets 2130 are not dependent on, nor constrained by, existing API architectures and/or supporting communications protocols. More broadly, there is nothing in the manner in which the speech data sets 2130 may be organized in storage, transmission and/or distribution via the network 2999 that is bound to existing API architectures or protocols.

Some systems may use Hadoop®, an open-source framework for storing and analyzing big data in a distributed computing environment. Some systems may use cloud computing, which can enable ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications and services) that can be rapidly provisioned and released with minimal management effort or service provider interaction. Some grid systems may be implemented as a multi-node Hadoop® cluster, as understood by a person of skill in the art. Apache™ Hadoop® is an open-source software framework for distributed computing. 

What is claimed is:
 1. A computer-program product embodied in a non-transitory machine-readable storage medium storing computer instructions that, when executed by one or more processors, perform operations comprising: distributing a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads; executing the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files, wherein each of the plurality of audio processing threads: partitions a target audio data file of the plurality of audio data files into a plurality of audio data segments, computes a plurality of embedding values based on the plurality of audio data segments, generates, via a clustering algorithm, a plurality of clusters of audio data segments based on the plurality of embedding values, and computes a plurality of embedding signatures for the plurality of tentative speakers participating in the target audio data file based on the plurality of clusters of audio data segments; generating, via the clustering algorithm, a plurality of clusters of embedding signatures based on the plurality of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files; and detecting a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures.
 2. The computer-program product according to claim 1, wherein: the plurality of audio data files include a first audio data file and a second audio data file, one of the plurality of clusters of embedding signatures includes an embedding signature associated with a first tentative speaker of the first audio data file and an embedding signature associated with a second tentative speaker of the second audio data file, and detecting the plurality of global speakers associated with the speech data corpus includes detecting that the first tentative speaker of the first audio data file and the second tentative speaker of the second audio data file correspond to a same global speaker of the plurality of global speakers based on the one of the plurality of clusters of embedding signatures including both the embedding signature of the first tentative speaker and the embedding signature of the second tentative speaker.
 3. The computer-program product according to claim 1, wherein: the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file and a second cluster of audio data segments corresponding to a second tentative speaker in the target audio data file, and computing an embedding signature for the first tentative speaker and an embedding signature for the second tentative speaker includes: computing a centroid of the first cluster of audio data segments and a centroid of the second cluster of audio data segments, using the centroid of the first cluster of audio data segments as the embedding signature for the first tentative speaker, and using the centroid of the second cluster of audio data segments as the embedding signature for the second tentative speaker.
 4. The computer-program product according to claim 1, wherein: the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file, the first cluster of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include speech audio spoken by the first tentative speaker, and computing an embedding signature for the first tentative speaker includes: implementing a speaker signature embeddings model, providing the plurality of embedding values associated with the first cluster of audio data segments as input to the speaker signature embeddings model, and computing, via the speaker signature embeddings model, an output comprising the embedding signature of the first tentative speaker based on the providing.
 5. The computer-program product according to claim 1, wherein detecting the plurality of global speakers associated with the speech data corpus includes: determining that each of the plurality of clusters of embedding signatures relates to a unique global speaker in the speech data corpus, and labeling each of the plurality of clusters of embedding signatures with a unique global speaker label based on the determining.
 6. The computer-program product according to claim 1, wherein: each of the plurality of audio data files is distributed to a target computing node of the plurality of computing nodes and a target audio processing thread of the target computing node, and executing the plurality of audio processing threads includes: concurrently executing the target audio processing thread associated with each of the plurality of audio data files, wherein the concurrently executing causes the plurality of tentative speakers in each of the plurality of audio data files to be detected in parallel.
 7. The computer-program product according to claim 1, wherein: the plurality of computing nodes are sub-nodes of a main computing node, and generating the plurality of clusters of embedding signatures includes: collecting the plurality of embedding signatures computed at each of the sub-nodes; providing, to the clustering algorithm implemented at the main computing node, the plurality of embedding signatures computed at each of the sub-nodes; and generating, via the clustering algorithm implemented at the main computing node, the plurality of clusters of embedding signatures.
 8. The computer-program product according to claim 1, wherein: each of the plurality of clusters of audio data segments corresponds to a unique one of the plurality of tentative speakers participating in the target audio data file, and each of the plurality of clusters of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include an utterance spoken by the unique one of the plurality of tentative speakers.
 9. The computer-program product according to claim 1, wherein computing the plurality of embedding values based on the plurality of audio data segments includes: deriving, via one or more feature extraction algorithms, a plurality of feature vectors corresponding to the plurality of audio data segments; providing, to an embedding model, an input comprising the plurality of feature vectors; and computing, via the embedding model, an embedding value corresponding to each of the plurality of audio data segments based on the input.
 10. The computer-program product according to claim 1, wherein: the speech data corpus stores the plurality of audio data files in a tabular data structure, and the tabular data structure comprises a plurality of rows that each correspond to a unique one of the plurality of audio data files.
 11. The computer-program product according to claim 1, wherein: the plurality of computing nodes includes a first computing node and a second computing node, a first audio data file of the plurality of audio data files is processed by a respective audio processing thread of the plurality of audio processing threads implemented at the first computing node, a second audio data file of the plurality of audio data files is processed by a respective audio processing thread of the plurality of audio processing threads implemented at the second computing node, the target audio data file for the respective audio processing thread implemented at the first computing node corresponds to the first audio data file, and the target audio data file for the respective audio processing thread implemented at the second computing node corresponds to the second audio data file.
 12. The computer-program product according to claim 1, wherein: the plurality of computing nodes includes a first computing node, a first audio data file of the plurality of audio data files is processed by a first audio processing thread of the plurality of audio processing threads implemented at the first computing node, a second audio data file of the plurality of audio data files is processed by a second audio processing thread of the plurality of audio processing threads implemented at the first computing node, the target audio data file for the first audio processing thread corresponds to the first audio data file, and the target audio data file for second audio processing thread corresponds to the second audio data file.
 13. A computer-implemented method comprising: distributing a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads; executing the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files, wherein each of the plurality of audio processing threads: partitions a target audio data file of the plurality of audio data files into a plurality of audio data segments, computes a plurality of embedding values based on the plurality of audio data segments, generates, via a clustering algorithm, a plurality of clusters of audio data segments based on the plurality of embedding values, and computes a plurality of embedding signatures for the plurality of tentative speakers participating in the target audio data file based on the plurality of clusters of audio data segments; generating, via the clustering algorithm, a plurality of clusters of embedding signatures based on the plurality of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files; and detecting a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures.
 14. The computer-implemented method according to claim 13, wherein: the plurality of audio data files include a first audio data file and a second audio data file, one of the plurality of clusters of embedding signatures includes an embedding signature associated with a first tentative speaker of the first audio data file and an embedding signature associated with a second tentative speaker of the second audio data file, and detecting the plurality of global speakers associated with the speech data corpus includes detecting that the first tentative speaker of the first audio data file and the second tentative speaker of the second audio data file correspond to a same global speaker of the plurality of global speakers based on the one of the plurality of clusters of embedding signatures including both the embedding signature of the first tentative speaker and the embedding signature of the second tentative speaker.
 15. The computer-implemented method according to claim 13, wherein: the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file and a second cluster of audio data segments corresponding to a second tentative speaker in the target audio data file, and computing an embedding signature for the first tentative speaker and an embedding signature for the second tentative speaker includes: computing a centroid of the first cluster of audio data segments and a centroid of the second cluster of audio data segments, using the centroid of the first cluster of audio data segments as the embedding signature for the first tentative speaker, and using the centroid of the second cluster of audio data segments as the embedding signature for the second tentative speaker.
 16. The computer-implemented method according to claim 13, wherein: the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file, the first cluster of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include speech audio spoken by the first tentative speaker, and computing an embedding signature for the first tentative speaker includes: implementing a speaker signature embeddings model, providing the plurality of embedding values associated with the first cluster of audio data segments as input to the speaker signature embeddings model, and computing, via the speaker signature embeddings model, an output comprising the embedding signature of the first tentative speaker based on the providing.
 17. The computer-implemented method according to claim 13, wherein detecting the plurality of global speakers associated with the speech data corpus includes: determining that each of the plurality of clusters of embedding signatures relates to a unique global speaker in the speech data corpus, and labeling each of the plurality of clusters of embedding signatures with a unique global speaker label based on the determining.
 18. The computer-implemented method according to claim 13, wherein: each of the plurality of audio data files is distributed to a target computing node of the plurality of computing nodes and a target audio processing thread of the target computing node, and executing the plurality of audio processing threads includes: concurrently executing the target audio processing thread associated with each of the plurality of audio data files, wherein the concurrently executing causes the plurality of tentative speakers in each of the plurality of audio data files to be detected in parallel.
 19. The computer-implemented method according to claim 13, wherein: the plurality of computing nodes are sub-nodes of a main computing node, and generating the plurality of clusters of embedding signatures includes: collecting the plurality of embedding signatures computed at each of the sub-nodes; providing, to the clustering algorithm implemented at the main computing node, the plurality of embedding signatures computed at each of the sub-nodes; and generating, via the clustering algorithm implemented at the main computing node, the plurality of clusters of embedding signatures.
 20. The computer-implemented method according to claim 13, wherein: each of the plurality of clusters of audio data segments corresponds to a unique one of the plurality of tentative speakers participating in the target audio data file, and each of the plurality of clusters of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include an utterance spoken by the unique one of the plurality of tentative speakers.
 21. The computer-implemented method according to claim 13, wherein computing the plurality of embedding values based on the plurality of audio data segments includes: deriving, via one or more feature extraction algorithms, a plurality of feature vectors corresponding to the plurality of audio data segments; providing, to an embedding model, an input comprising the plurality of feature vectors; and computing, via the embedding model, an embedding value corresponding to each of the plurality of audio data segments based on the input.
 22. A computer-implemented system comprising: one or more processors; a memory; a computer-readable medium operably coupled to the one or more processors, the computer-readable medium having computer-readable instructions stored thereon that, when executed by the one or more processors, cause a computing device to perform operations comprising: distributing a plurality of audio data files of a speech data corpus to a plurality of computing nodes that each implement a plurality of audio processing threads; executing the plurality of audio processing threads associated with each of the plurality of computing nodes to detect a plurality of tentative speakers participating in each of the plurality of audio data files, wherein each of the plurality of audio processing threads: partitions a target audio data file of the plurality of audio data files into a plurality of audio data segments, computes a plurality of embedding values based on the plurality of audio data segments, generates, via a clustering algorithm, a plurality of clusters of audio data segments based on the plurality of embedding values, and computes a plurality of embedding signatures for the plurality of tentative speakers participating in the target audio data file based on the plurality of clusters of audio data segments; generating, via the clustering algorithm, a plurality of clusters of embedding signatures based on the plurality of embedding signatures associated with the plurality of tentative speakers in each of the plurality of audio data files; and detecting a plurality of global speakers associated with the speech data corpus based on the plurality of clusters of embedding signatures.
 23. The computer-implemented system according to claim 22, wherein: the plurality of audio data files include a first audio data file and a second audio data file, one of the plurality of clusters of embedding signatures includes an embedding signature associated with a first tentative speaker of the first audio data file and an embedding signature associated with a second tentative speaker of the second audio data file, and detecting the plurality of global speakers associated with the speech data corpus includes detecting that the first tentative speaker of the first audio data file and the second tentative speaker of the second audio data file correspond to a same global speaker of the plurality of global speakers based on the one of the plurality of clusters of embedding signatures including both the embedding signature of the first tentative speaker and the embedding signature of the second tentative speaker.
 24. The computer-implemented system according to claim 22, wherein: the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file and a second cluster of audio data segments corresponding to a second tentative speaker in the target audio data file, and computing an embedding signature for the first tentative speaker and an embedding signature for the second tentative speaker includes: computing a centroid of the first cluster of audio data segments and a centroid of the second cluster of audio data segments, using the centroid of the first cluster of audio data segments as the embedding signature for the first tentative speaker, and using the centroid of the second cluster of audio data segments as the embedding signature for the second tentative speaker.
 25. The computer-implemented system according to claim 22, wherein: the plurality of clusters of audio data segments include a first cluster of audio data segments corresponding to a first tentative speaker in the target audio data file, the first cluster of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include speech audio spoken by the first tentative speaker, and computing an embedding signature for the first tentative speaker includes: implementing a speaker signature embeddings model, providing the plurality of embedding values associated with the first cluster of audio data segments as input to the speaker signature embeddings model, and computing, via the speaker signature embeddings model, an output comprising the embedding signature of the first tentative speaker based on the providing.
 26. The computer-implemented system according to claim 22, wherein detecting the plurality of global speakers associated with the speech data corpus includes: determining that each of the plurality of clusters of embedding signatures relates to a unique global speaker in the speech data corpus, and labeling each of the plurality of clusters of embedding signatures with a unique global speaker label based on the determining.
 27. The computer-implemented system according to claim 22, wherein: each of the plurality of audio data files is distributed to a target computing node of the plurality of computing nodes and a target audio processing thread of the target computing node, and executing the plurality of audio processing threads includes: concurrently executing the target audio processing thread associated with each of the plurality of audio data files, wherein the concurrently executing causes the plurality of tentative speakers in each of the plurality of audio data files to be detected in parallel.
 28. The computer-implemented system according to claim 22, wherein: the plurality of computing nodes are sub-nodes of a main computing node, and generating the plurality of clusters of embedding signatures includes: collecting the plurality of embedding signatures computed at each of the sub-nodes; providing, to the clustering algorithm implemented at the main computing node, the plurality of embedding signatures computed at each of the sub-nodes; and generating, via the clustering algorithm implemented at the main computing node, the plurality of clusters of embedding signatures.
 29. The computer-implemented system according to claim 22, wherein: each of the plurality of clusters of audio data segments corresponds to a unique one of the plurality of tentative speakers participating in the target audio data file, and each of the plurality of clusters of audio data segments includes a plurality of embedding values corresponding to a plurality of audio data segments that likely include an utterance spoken by the unique one of the plurality of tentative speakers.
 30. The computer-implemented system according to claim 22, wherein computing the plurality of embedding values based on the plurality of audio data segments includes: deriving, via one or more feature extraction algorithms, a plurality of feature vectors corresponding to the plurality of audio data segments; providing, to an embedding model, an input comprising the plurality of feature vectors; and computing, via the embedding model, an embedding value corresponding to each of the plurality of audio data segments based on the input. 